Graph Subcolorings: Complexity and Algorithms.
Jirí FialaKlaus JansenVan Bang LeEike SeidelPublished in: WG (2001)
Keyphrases
- computational complexity
- high computational complexity
- worst case
- graph theory
- polynomial time complexity
- space complexity
- computationally efficient
- computational cost
- significant improvement
- orders of magnitude
- maximum flow
- graph properties
- learning algorithm
- random walk
- graph representation
- data structure
- breadth first search
- complexity measures