A new lower bound on critical graphs with maximum degree of 8 and 9.
Xuechao LiPublished in: Ars Comb. (2011)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- lower and upper bounds
- branch and bound
- objective function
- sufficiently accurate
- random graphs
- graph structure
- graph mining
- graph databases
- graph representation
- graph theoretic
- upper and lower bounds
- graph matching
- complex structures
- maximum number
- np hard
- lower bounding
- graph theory
- weighted graph
- graph model
- sample complexity
- worst case
- pairwise