Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation.
Parinya ChalermsookBundit LaekhanukitDanupon NanongkaiPublished in: LATIN (2014)
Keyphrases
- graph structure
- weighted graph
- error bounds
- graph representation
- graph mining
- directed graph
- random walk
- np complete
- structured data
- worst case
- connected components
- upper bound
- graph clustering
- graph matching
- graph theory
- random graphs
- graph partitioning
- graph based algorithm
- ranking algorithm
- graph model
- neural network
- life cycle
- computational complexity
- objective function
- image segmentation