Graph Subcolorings: Complexity and Algorithms.
Jirí FialaKlaus JansenVan Bang LeEike SeidelPublished in: SIAM J. Discret. Math. (2003)
Keyphrases
- computational cost
- high computational complexity
- worst case
- graph theory
- space complexity
- orders of magnitude
- computational complexity
- learning algorithm
- theoretical analysis
- data structure
- complexity analysis
- graph structure
- polynomial time complexity
- optimization problems
- np complete
- random walk
- markov random field
- benchmark datasets
- structured data
- memory requirements
- decision trees
- web pages
- neural network
- graph construction
- maximal cliques