## Greed Is Good: Parallel Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures

- Mustafa Kemal Tas, Kamer Kaya, Erik Saule
- 2017 46th International Conference on Parallel…
- 2017

Highly Influenced

@inproceedings{Bozdag2005APD, title={A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers}, author={Doruk Bozdag and {\"U}mit V. Çataly{\"u}rek and Assefaw Hadish Gebremedhin and Fredrik Manne and Erik G. Boman and F{\"u}sun {\"O}zg{\"u}ner}, booktitle={HPCC}, year={2005} }

- Published 2005 in HPCC
DOI:10.1007/11557654_90

The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two from each other. Application examples include numerical optimization and channel assignment. We present the first distributed-memory heuristic algorithm for this NP-hard problem. Parallel speedup is achieved through graph partitioning, speculative (iterative) coloring, and a BSP-like organization of computation. Experimental… CONTINUE READING

Highly Cited

This paper has 31 citations. REVIEW CITATIONS

20 Citations

11 References

Similar Papers