92 search results - page 13 / 19 » Scalable parallel graph coloring algorithms |
PPSN
1992
Springer
14 years 1 days ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
SC
2009
ACM
14 years 2 months ago
2009
ACM
Large graph analysis has become increasingly important and is widely used in many applications such as web mining, social network analysis, biology, and information retrieval. The...
BMCBI
2008
13 years 8 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
SPAA
2009
ACM
14 years 2 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
PLDI
2012
ACM
11 years 10 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...