skip to content
Determining the Chromatic Number of a Graph. Preview this item
ClosePreview this item
Checking...

Determining the Chromatic Number of a Graph.

Author: Colin McDiarmid; STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE.
Publisher: Ft. Belvoir Defense Technical Information Center OCT 1976.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
Certain algorithms concerning coloring graphs involve the partial exploration of Zykov trees. We investigate the size of such trees, and prove that a certain class of branch-and-bound algorithms for determining the chromatic number of a graph requires in probability a number of steps which grows faster than exponentially with the number of vertices of the graph. (Author).
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Colin McDiarmid; STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE.
OCLC Number: 227444418
Description: 63 p.

Abstract:

Certain algorithms concerning coloring graphs involve the partial exploration of Zykov trees. We investigate the size of such trees, and prove that a certain class of branch-and-bound algorithms for determining the chromatic number of a graph requires in probability a number of steps which grows faster than exponentially with the number of vertices of the graph. (Author).

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227444418>
library:oclcnum"227444418"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227444418>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:datePublished"OCT 1976"
schema:datePublished"1976"
schema:description"Certain algorithms concerning coloring graphs involve the partial exploration of Zykov trees. We investigate the size of such trees, and prove that a certain class of branch-and-bound algorithms for determining the chromatic number of a graph requires in probability a number of steps which grows faster than exponentially with the number of vertices of the graph. (Author)."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/13515313>
schema:inLanguage"en"
schema:name"Determining the Chromatic Number of a Graph."@en
schema:numberOfPages"63"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.