92 search results - page 2 / 19 » Scalable parallel graph coloring algorithms |
PARA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
PPAM
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
ISAAC
2001
Springer
13 years 9 months ago
2001
Springer
SC
2005
ACM
13 years 10 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
PODC
2010
ACM
13 years 7 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...