## A Study of Graph Decomposition Algorithms for Parallel Symmetry Breaking

- Sayyad Nayyaroddeen, Mahak Gambhir, Kishore Kothapalli
- 2017 IEEE International Parallel and Distributed…
- 2017

This paper introduces the largest-log-degree-first (LLF) and smallest-log-degree-last (SLL) ordering heuristics for parallel greedy graph-coloring algorithms, which are inspired by the largest-degree-first (LF) and smallest-degree-last (SL) serial heuristics, respectively. We show that although LF and SL, in practice, generate colorings with relatively… (More)

Citations per Year

Averaging **12 citations** per year over the last 3 years.

Showing 1-10 of 11 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

### Presentations referencing similar topics