Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs (Q2082190)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs |
scientific article; zbMATH DE number 7595915
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs |
scientific article; zbMATH DE number 7595915 |
Statements
Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs (English)
0 references
4 October 2022
0 references
\(k\)-edge-connectivity
0 references
\(k\)-connectivity
0 references
generalized connectivity
0 references
\(S\)-Steiner tree
0 references
\(k\)-way cut
0 references
0 references
