ABSTRACT
Combinatorial problems often arise within the context of scientific computing. As a result, combinatorial scientific computing (CSC) has become a fruitful research area, enabling the development of efficient and effective numerical simulations for a variety of scientific applications. In this chapter, we focus on three important CSC problems: partitioning (load balancing), graph coloring, and sparse matrix ordering. Through examples, we show how these problems occur in applications. Our target audience is computational scientists who may have little prior knowledge of CSC.
