Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs

DOI10.1007/s10878-020-00541-zzbMath1502.90155OpenAlexW3006344862MaRDI QIDQ2082190

Yanyan Li

Publication date: 4 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00541-z

zbMATH Keywords

\(k\)-connectivitygeneralized connectivity\(k\)-edge-connectivity\(k\)-way cut\(S\)-Steiner tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Concentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tree connectivities of Cayley graphs on abelian groups with small degrees
• A solution to a conjecture on the generalized connectivity of graphs
• On the difference of two generalized connectivities of a graph
• Connectivity of Cartesian product graphs
• Diameter and connectivity of 3-arc graphs
• Pendant tree-connectivity
• On the \(\ell\)-connectivity of a graph
• A new and improved algorithm for the 3-cut problem
• Rainbow connections of graphs: a survey
• Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
• On the maximum and minimum sizes of a graph with given \(k\)-connectivity
• A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
• On the generalized (edge-)connectivity of graphs
• The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs
• Clique Cover and Graph Separation
• Controllability and Observability of Network-of-Networks via Cartesian Products
• Generalized Connectivity of Graphs
• A Generalization of Line Connectivity and Optimally Invulnerable Graphs
• A Polynomial Algorithm for the k-cut Problem for Fixed k
• The generalized 3-connectivity of Lexicographic product graphs
• Generalized 3-edge-connectivity of Cartesian product graphs
• The generalized 3-connectivity of Cartesian product graphs
• A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
• The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable
• Parameterized Algorithms

This page was built for publication: Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs