On the upper bound of the diameter of interchange graphs.
Jianguo QianPublished in: Discret. Math. (1999)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- worst case
- branch and bound
- average degree
- graph theoretic
- lower and upper bounds
- error probability
- branch and bound algorithm
- graph matching
- structured objects
- generalization error
- data structure
- interchange format
- series parallel
- np hard
- graph partitioning
- spanning tree
- constant factor
- graph databases
- graph theory
- labeled graphs
- pattern recognition
- bayesian networks