de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

Minimum Coloring k-Colorable Graphs in Polynomial Average Time

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45571

Subramanian,  C. R.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Subramanian, C. R. (1999). Minimum Coloring k-Colorable Graphs in Polynomial Average Time. Journal of Algorithms, 33, 112-123.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-35DD-D
Zusammenfassung
We present algorithms for minimum coloring k-colorable graphs drawn from random and semi-random models. In the first model, each allowed edge is included with indpendent probability p. In the second model, an adversary is given the power to vary the edge probability as the random instance is built. Semi-random models were introduced as a way of striking a balance between random graphs and worst-case adversaries. Our algorithms run in polynomial time on the average. Minimum coloring is harder than k-coloring because even a ''short certificate'' is not presently known for the optimality of a coloring.