Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
type: Item
instance of: scholarly article
title: Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
zbMATH Open document ID: 1502.90155
author: Yanyan Li
published in: Journal of Combinatorial Optimization
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7595915
zbMATH Keywords: \(k\)-edge-connectivity
zbMATH Keywords: \(k\)-connectivity
zbMATH Keywords: generalized connectivity
zbMATH Keywords: \(S\)-Steiner tree
zbMATH Keywords: \(k\)-way cut
MaRDI profile type: Publication
full work available at URL: s10878-020-00541-z
OpenAlex ID: W3006344862
cites work: A Generalization of Line Connectivity and Optimally Invulnerable Graphs
cites work: Q5422499
cites work: A new and improved algorithm for the 3-cut problem
cites work: Controllability and Observability of Network-of-Networks via Cartesian Products
cites work: A solution to a conjecture on the generalized connectivity of graphs
cites work: Parameterized Algorithms
cites work: Clique Cover and Graph Separation
cites work: Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems
cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k
cites work: Pendant tree-connectivity
cites work: Q5668506
cites work: Q3872508
cites work: Q4523707
cites work: A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
cites work: The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable
cites work: Diameter and connectivity of 3-arc graphs
cites work: The generalized 3-connectivity of Cartesian product graphs
cites work: The generalized 3-connectivity of Lexicographic product graphs
cites work: Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
cites work: Generalized Connectivity of Graphs
cites work: On the generalized (edge-)connectivity of graphs
cites work: Rainbow connections of graphs: a survey
cites work: The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs
cites work: On the \(\ell\)-connectivity of a graph
cites work: Generalized 3-edge-connectivity of Cartesian product graphs
cites work: On the maximum and minimum sizes of a graph with given \(k\)-connectivity
cites work: A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
cites work: On the difference of two generalized connectivities of a graph
cites work: Tree connectivities of Cayley graphs on abelian groups with small degrees
cites work: Q3549696
cites work: Connectivity of Cartesian product graphs
DOI: 10.1007/S10878-020-00541-Z
description: scientific article; zbMATH DE number 7595915