Upper bounds for the MD-numbers and characterization of extremal graphs.
Ping LiXueliang LiPublished in: Discret. Appl. Math. (2021)
Keyphrases
- upper bound
- graph theory
- lower bound
- upper and lower bounds
- lower and upper bounds
- graph theoretic
- tight bounds
- sample size
- branch and bound
- branch and bound algorithm
- graph structure
- sample complexity
- complex structures
- worst case
- graph mining
- graph matching
- directed graph
- graph databases
- theoretical analysis
- graph clustering
- permutation flowshop