A framework for scalable greedy coloring on distributed-memory parallel computers
Authors:
- Doruk BozdağDBDoruk Bozdağ
- Assefaw H. GebremedhinAGAssefaw H. Gebremedhin
- Fredrik ManneFMFredrik Manne
- Erik G. BomanEBErik G. Boman
- Umit V. CatalyurekUCUmit V. Catalyurek
- 1 April 2008
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 68 (4) , 515-535
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- What Color Is Your Jacobian? Graph Coloring for Computing DerivativesSIAM Review, 2005
- An Experimental Analysis of Simple, Distributed Vertex Coloring AlgorithmsAlgorithmica, 2004
- Parallel Scientific Computation2004
- Graph coloring on coarse grained multicomputersDiscrete Applied Mathematics, 2003
- Zoltan data management services for parallel dynamic applicationsComputing in Science & Engineering, 2002
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- Scalable parallel graph coloring algorithmsConcurrency: Practice and Experience, 2000
- Simple distributed Δ+1-coloring of graphsInformation Processing Letters, 1999
- Parallel Heuristics for Improved, Balanced Graph ColoringsJournal of Parallel and Distributed Computing, 1996
- Estimation of Sparse Jacobian Matrices and Graph Coloring BlemsSIAM Journal on Numerical Analysis, 1983