Algorithms for coloring semi-random graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199809)13:2<125::AID-RSA2>3.0.CO;2-T" /><125::AID-RSA2>3.0.CO;2-T 10.1002/(SICI)1098-2418(199809)13:2<125::AID-RSA2>3.0.CO;2-TzbMath0959.68531OpenAlexW2005942657MaRDI QIDQ4705329

C. R. Subramanian, C. E. Veni Madhavan, Martin Fuerer

Publication date: 19 December 1999

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199809)13:2<125::aid-rsa2>3.0.co;2-t

zbMATH Keywords

polynomial time algorithmsgraph coloring problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Algorithms for coloring semi-random graphs