Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph (Q1977862)
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: Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph |
scientific article; zbMATH DE number 1455869
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph |
scientific article; zbMATH DE number 1455869 |
Statements
Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph (English)
0 references
14 January 2001
0 references
edge-connectivity
0 references
vertex-connectivity
0 references
graph augmentation
0 references
polynomial deterministic algorithm
0 references
undirected multigraph
0 references
0.92650765
0 references
0.89606357
0 references
0.8922007
0 references
