Improved bounds for the product of the domination and chromatic numbers of a graph.
Yair CaroYehuda RodittyPublished in: Ars Comb. (2000)
Keyphrases
- graph representation
- graph structure
- directed graph
- lower bound
- upper bound
- random walk
- life cycle
- spanning tree
- improved algorithm
- weighted graph
- graph theory
- connected components
- np hard
- product quality
- data sets
- graph partitioning
- product information
- graph mining
- link analysis
- color information
- graph matching
- image segmentation