A sharp lower bound for the circumference of 1-tough graphs with large degree sums.
Vu Dinh HoaPublished in: J. Graph Theory (1995)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- optimal solution
- random graphs
- worst case
- high quality
- objective function
- lower and upper bounds
- graph matching
- lower bounding
- graph partitioning
- np hard
- graph structure
- graph theory
- power law
- graph mining
- directed graph
- graph clustering
- random variables
- linear programming relaxation
- polynomial approximation