Algorithms for Colouring Random k-colourable Graphs

Subramanian, C. R.

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Algorithms for Colouring Random k-colourable Graphs

MPS-Authors

/persons/resource/persons45571

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

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Subramanian, C. R. (2000). Algorithms for Colouring Random k-colourable Graphs. Combinatorics, Probability and Computing, 9(1), 45-77. Retrieved from http://www.journals.cup.org/bin/bladerunner?REQUNIQ=984145552&REQSESS=1859236&117000REQEVENT=&REQINT1=46754&REQAUTH=0.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-336D-A

Abstract

Almost surely succeeding and polynomial average time algorithms for coloring random k-colorable graphs are presented.