The Complexity of the Vertex Coloring Problem on Hierarchies of Sparse Graphs.
H. MüllerPublished in: WG (1982)
Keyphrases
- undirected graph
- directed graph
- labeled graphs
- worst case
- attributed graphs
- sparse data
- high dimensional
- representational power
- graph theory
- computational complexity
- graph mining
- sparse coding
- graph theoretic
- decision problems
- compressive sensing
- sparse representation
- computational cost
- optimal solution
- sparse sampling