Tight upper bound on the maximum anti-forcing numbers of graphs.
Lingjuan ShiHeping ZhangPublished in: Discret. Math. Theor. Comput. Sci. (2017)
Keyphrases
- upper bound
- lower bound
- worst case
- minimum distance
- branch and bound algorithm
- branch and bound
- generalization error
- upper and lower bounds
- lower and upper bounds
- graph theoretic
- graph matching
- graph theory
- graph mining
- structured objects
- objective function
- subgraph isomorphism
- data structure
- sample complexity
- graph clustering
- probabilistic model
- graph construction
- np hard