Linked Data Explorerhttp://worldcat.org/entity/work/id/13515313
Determining the chromatic number of a graph
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).
Open All Close All
http://schema.org/about
- http://experiment.worldcat.org/entity/work/data/13515313#Topic/chromaticity
- http://id.loc.gov/authorities/subjects/sh85137259
- http://experiment.worldcat.org/entity/work/data/13515313#Topic/statistics_and_probability
- http://experiment.worldcat.org/entity/work/data/13515313#Topic/graphs
- http://id.worldcat.org/fast/805020
- http://id.worldcat.org/fast/1156136
- http://id.loc.gov/authorities/subjects/sh85056481
- http://experiment.worldcat.org/entity/work/data/13515313#Topic/combinatorial_analysis
- http://experiment.worldcat.org/entity/work/data/13515313#Topic/algorithms
- http://id.loc.gov/authorities/subjects/sh85003487
- http://experiment.worldcat.org/entity/work/data/13515313#Topic/numbering_systems
- http://experiment.worldcat.org/entity/work/data/13515313#Topic/probability
- http://id.worldcat.org/fast/946645
http://schema.org/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