Algorithms for Finding in the Lump Both Bounds of Chromatic Number of a Graph.
T. SakakiK. NakashimaY. HattoriPublished in: Comput. J. (1976)
Keyphrases
- computational complexity
- memory requirements
- learning algorithm
- small number
- worst case
- graph theory
- minimum spanning tree
- upper and lower bounds
- vc dimension
- polynomial time complexity
- maximum clique
- randomized algorithm
- web graph
- space complexity
- graph model
- directed graph
- theoretical analysis
- computationally efficient
- random walk
- lower bound
- weighted graph
- data dependent
- shortest path
- graph theoretic
- average case
- edge weights
- graph construction
- graph search
- partitioning algorithm
- computational cost