Sharp upper bounds for generalized edge-connectivity of product graphs.
Yuefang SunPublished in: Discuss. Math. Graph Theory (2016)
Keyphrases
- upper bound
- weighted graph
- lower bound
- undirected graph
- strongly connected
- upper and lower bounds
- edge detection
- lower and upper bounds
- directed graph
- graph theoretic
- sharp edges
- tight bounds
- edge information
- minimum spanning trees
- branch and bound
- graph matching
- branch and bound algorithm
- worst case
- graph connectivity
- life cycle
- adjacency graph
- high quality
- topological properties
- product design
- tight upper and lower bounds
- spanning tree
- graph structure
- graph theory
- shortest path
- production planning
- graph representation
- sample complexity
- graph mining
- edge detector