Ordering heuristics for parallel graph coloring

Abstract

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)
DOI: 10.1145/2612669.2612697

8 Figures and Tables

Topics

Statistics

01020201520162017
Citations per Year

Citation Velocity: 12

Averaging 12 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.
  • Presentations referencing similar topics