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:   Print 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 pages

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


Primary Entity

<http://www.worldcat.org/oclc/227444418> # Determining the Chromatic Number of a Graph.
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "227444418" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/13515313#Place/ft_belvoir> ; # Ft. Belvoir
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/vau> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/13515313#Topic/numbering_systems> ; # Numbering systems
   schema:about <http://experiment.worldcat.org/entity/work/data/13515313#Thing/zykov_trees> ; # Zykov trees
   schema:about <http://experiment.worldcat.org/entity/work/data/13515313#Topic/chromaticity> ; # Chromaticity
   schema:about <http://experiment.worldcat.org/entity/work/data/13515313#Topic/statistics_and_probability> ; # Statistics and Probability
   schema:about <http://experiment.worldcat.org/entity/work/data/13515313#Thing/coloring_graphs> ; # Coloring graphs
   schema:about <http://experiment.worldcat.org/entity/work/data/13515313#Topic/probability> ; # Probability
   schema:about <http://experiment.worldcat.org/entity/work/data/13515313#Thing/combinatorial_mathematics> ; # Combinatorial mathematics
   schema:about <http://experiment.worldcat.org/entity/work/data/13515313#Topic/graphs> ; # Graphs
   schema:about <http://experiment.worldcat.org/entity/work/data/13515313#Topic/algorithms> ; # Algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/13515313#Topic/combinatorial_analysis> ; # Combinatorial analysis
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/13515313#Organization/stanford_univ_calif_dept_of_computer_science> ; # STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE.
   schema:contributor <http://experiment.worldcat.org/entity/work/data/13515313#Person/mcdiarmid_colin> ; # Colin McDiarmid
   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:productID "227444418" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/227444418#PublicationEvent/ft_belvoirdefense_technical_information_centeroct_1976> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/13515313#Agent/defense_technical_information_center> ; # Defense Technical Information Center
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/227444418> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/13515313#Agent/defense_technical_information_center> # Defense Technical Information Center
    a bgn:Agent ;
   schema:name "Defense Technical Information Center" ;
    .

<http://experiment.worldcat.org/entity/work/data/13515313#Organization/stanford_univ_calif_dept_of_computer_science> # STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE.
    a schema:Organization ;
   schema:name "STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE." ;
    .

<http://experiment.worldcat.org/entity/work/data/13515313#Person/mcdiarmid_colin> # Colin McDiarmid
    a schema:Person ;
   schema:familyName "McDiarmid" ;
   schema:givenName "Colin" ;
   schema:name "Colin McDiarmid" ;
    .

<http://experiment.worldcat.org/entity/work/data/13515313#Thing/combinatorial_mathematics> # Combinatorial mathematics
    a schema:Thing ;
   schema:name "Combinatorial mathematics" ;
    .

<http://experiment.worldcat.org/entity/work/data/13515313#Topic/combinatorial_analysis> # Combinatorial analysis
    a schema:Intangible ;
   schema:name "Combinatorial analysis"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/13515313#Topic/statistics_and_probability> # Statistics and Probability
    a schema:Intangible ;
   schema:name "Statistics and Probability"@en ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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