Tight isolated toughness bound for fractional (k, n)-critical graphs.
Wei GaoWeifan WangYaojun ChenPublished in: Discret. Appl. Math. (2022)
Keyphrases
- lower bound
- upper bound
- worst case
- generalization error bounds
- graph theory
- graph representation
- pattern recognition
- objective function
- graph theoretic
- machine learning
- graph matching
- bipartite graph
- graph structure
- weighted graph
- generalization error
- graph mining
- graph model
- error bounds
- optimal solution
- graph structures
- series parallel
- np hard