A lower bound on the average shortest path length in regular graphs.
Vinton G. CerfDonald D. CowanR. C. MullinR. G. StantonPublished in: Networks (1974)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- optimal solution
- lower and upper bounds
- objective function
- standard deviation
- graph mining
- graph matching
- graph databases
- graph theoretic
- worst case
- boolean functions
- graph representation
- subgraph isomorphism
- lower bounding
- path length
- polynomial approximation
- vc dimension
- sample complexity
- graph structure
- bipartite graph
- directed graph
- linear programming