Upper bounds for the achromatic and coloring numbers of a graph.
Baoyindureng WuClive ElphickPublished in: Discret. Appl. Math. (2017)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- directed graph
- worst case
- lower and upper bounds
- graph representation
- tight bounds
- connected components
- branch and bound algorithm
- constant factor
- weighted graph
- dependency graph
- graph structure
- graph theory
- graph matching
- structured data
- graph based algorithm
- efficiently computable
- multiagent evolutionary algorithm
- random graphs
- colour images
- graph theoretic
- graph partitioning
- color constancy
- graph model
- graph mining
- directed acyclic graph