A framework for scalable greedy coloring on distributed-memory parallel computers

This publication has 18 references indexed in Scilit:

• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
  SIAM Review, 2005
• An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms
  Algorithmica, 2004
• Parallel Scientific Computation
  Published by Oxford University Press (OUP) ,2004
• Graph coloring on coarse grained multicomputers
  Discrete Applied Mathematics, 2003
• Zoltan data management services for parallel dynamic applications
  Computing in Science & Engineering, 2002
• Benchmarking optimization software with performance profiles
  Mathematical Programming, 2002
• Scalable parallel graph coloring algorithms
  Concurrency: Practice and Experience, 2000
• Simple distributed Δ+1-coloring of graphs
  Information Processing Letters, 1999
• Parallel Heuristics for Improved, Balanced Graph Colorings
  Journal of Parallel and Distributed Computing, 1996
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
  SIAM Journal on Numerical Analysis, 1983