Lower bounds on the vertex-connectivity of digraphs and graphs.
Angelika HellwigLutz VolkmannPublished in: Inf. Process. Lett. (2006)
Keyphrases
- lower bound
- directed graph
- undirected graph
- strongly connected
- connected components
- upper bound
- labeled graphs
- random walk
- attributed graphs
- np hard
- minimum cost
- approximation algorithms
- worst case
- branch and bound
- branch and bound algorithm
- topological information
- objective function
- directed acyclic graph
- lower and upper bounds
- hamiltonian cycle
- lower bounding
- connected subgraphs
- random graphs
- betweenness centrality
- graph databases
- average degree
- maximum cardinality
- sample complexity
- spanning tree
- graph matching
- complex networks
- optimal solution
- equivalence classes
- upper and lower bounds
- triangle mesh
- vertex set
- weighted graph
- graph structure
- special case