Lower-bounds on the connectivities of a graph.
Abdol-Hossein EsfahanianPublished in: J. Graph Theory (1985)
Keyphrases
- lower bound
- graph theoretic
- upper bound
- min sum
- graph theory
- branch and bound
- graph matching
- graph structure
- random walk
- structured data
- objective function
- np hard
- connected components
- lower and upper bounds
- directed graph
- branch and bound algorithm
- graph representation
- weighted graph
- graph databases
- directed acyclic graph
- pairwise
- graph partitioning
- bipartite graph
- learning algorithm
- worst case
- upper and lower bounds
- graph based algorithm
- similarity measure