Lower bound of cyclic edge connectivity for n-extendability of regular graphs.
Dingjun LouDerek A. HoltonPublished in: Discret. Math. (1993)
Keyphrases
- lower bound
- weighted graph
- upper bound
- undirected graph
- strongly connected
- branch and bound algorithm
- branch and bound
- minimum spanning trees
- optimal solution
- np hard
- connected components
- graph connectivity
- objective function
- lower bounding
- worst case
- edge detection
- graph theoretic
- graph matching
- spanning tree
- lower and upper bounds
- directed graph
- graph theory
- graph mining
- random graphs
- bipartite graph
- vertex set
- graph databases
- edge detector
- edge information
- edge weights
- graph data
- learning theory
- graph kernels
- graph representation
- competitive ratio
- shortest path
- graph partitioning
- adjacency graph
- edge map