Combinatorial scientific computing: The enabling power of discrete algorithms in computational science (2006)
| Venue: | In 7th Intl. Mtg. High Perf. Comput. for Computational Sci. (VECPAR’06), Lecture Notes in Computer Science |
| Citations: | 4 - 1 self |
BibTeX
@INPROCEEDINGS{Hendrickson06combinatorialscientific,
author = {Bruce Hendrickson and Alex Pothen},
title = {Combinatorial scientific computing: The enabling power of discrete algorithms in computational science},
booktitle = {In 7th Intl. Mtg. High Perf. Comput. for Computational Sci. (VECPAR’06), Lecture Notes in Computer Science},
year = {2006},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Combinatorial algorithms have long played a crucial, albeit under-recognized role in scientific computing. This impact ranges well beyond the familiar applications of graph algorithms in sparse matrices to include mesh generation, optimization, computational biology and chemistry, data analysis and parallelization. Trends in science and in computing suggest strongly that the importance of discrete algorithms in computational science will continue to grow. This paper reviews some of these many past successes and highlights emerging areas of promise and opportunity. 1
