A ne w graph coloring algorit hm is prese nt ed and compared to a wide variety of known algorit hms. The algorithm is shown to exhibit O(n 2) time be havior for most s parse graphs and thus is found to be parti cularl y well s uited for use wi th large-scale sc heduling problems. In addition, a procedure for ge nerating large random test graphs with known chromatic number is present ed and is used to e valu ate he uri sti call y the capabiliti es of the a lgorithms discussed.
No takes yet. Share an insight, caveat, or question.
Frank Thomson Leighton (1979) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: