Sharp upper bounds on the Q-index of (minimally) 2-connected graphs with given size.
Shu-Guang GuoRong ZhangPublished in: Discret. Appl. Math. (2022)
Keyphrases
- upper bound
- lower bound
- branch and bound
- connected graphs
- lower and upper bounds
- database
- high quality
- upper and lower bounds
- small size
- constant factor
- tight bounds
- data structure
- worst case
- markov random field
- sample size
- optimal solution
- approximation algorithms
- indexing techniques
- generalization error
- efficiently computable
- databases