On Various Algorithms for Estimating the Chromatic Number of a Graph.
John MitchemPublished in: Comput. J. (1976)
Keyphrases
- computational complexity
- polynomial time complexity
- graph theory
- computationally efficient
- graph representation
- data structure
- run times
- learning algorithm
- orders of magnitude
- memory requirements
- theoretical analysis
- space complexity
- graph theoretic
- edge weights
- random graphs
- execution times
- maximum flow
- small number
- random walk
- structured data
- times faster
- np complete
- partitioning algorithm
- maximum weight