Leighton, Frank Thomson A graph coloring algorithm for large scheduling problems. (English) Zbl 0437.68021 J. Res. Natl. Bur. Stand. 84, 489-506 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 73 Documents MSC: 68M20 Performance evaluation, queueing, and scheduling in the context of computer systems 68Q25 Analysis of algorithms and problem complexity 05C15 Coloring of graphs and hypergraphs Keywords:time complexity; graph coloring algorithm; sparse graphs; large-scale scheduling; large random test graphs PDF BibTeX XML Cite \textit{F. T. Leighton}, J. Res. Natl. Bur. Stand. 84, 489--506 (1979; Zbl 0437.68021) Full Text: DOI Link OpenURL