Algorithms for Colouring Random k-colourable Graphs

Subramanian, C. R.

Local TagsRelease HistoryDetailsSummary

Algorithms for Colouring Random k-colourable Graphs

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-336D-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-336E-8

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Subramanian, C. R.¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

hide

Free keywords: -

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

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 2000

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 518060
URI: http://www.journals.cup.org/bin/bladerunner?REQUNIQ=984145552&REQSESS=1859236&117000REQEVENT=&REQINT1=46754&REQAUTH=0
Other: Local-ID: C1256428004B93B8-CA74C59A894208BAC12568AC00546D3D-crscpc

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Combinatorics, Probability and Computing

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 9 (1) Sequence Number: - Start / End Page: 45 - 77 Identifier: ISSN: 0963-5483