A sharp lower bound for generalized 3-edge-connectivity of strong product graphs.
Yuefang SunPublished in: Discuss. Math. Graph Theory (2017)
Keyphrases
- lower bound
- upper bound
- weighted graph
- strongly connected
- undirected graph
- branch and bound algorithm
- sharp edges
- branch and bound
- life cycle
- connected components
- lower and upper bounds
- graph matching
- directed graph
- edge information
- minimum spanning trees
- graph theoretic
- graph connectivity
- worst case
- optimal solution
- product design
- binary images
- graph mining
- spanning tree
- edge detection
- production planning
- edge weights
- topological information
- graph structure
- polynomial approximation
- adjacency graph
- np hard
- linear programming relaxation
- product quality
- random graphs
- random walk
- shortest path
- graph theory
- objective function
- multiscale