Augmenting a (\(k\)-1)-vertex-connected multigraph to an \(l\)-edge-connected and \(k\)-vertex-connected multigraph (Q4938784)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1405799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Augmenting a (\(k\)-1)-vertex-connected multigraph to an \(l\)-edge-connected and \(k\)-vertex-connected multigraph |
scientific article; zbMATH DE number 1405799 |
Statements
27 March 2000
0 references
vertex-connected
0 references
edge-connected
0 references
multigraph
0 references
0.960129737854004
0 references
0.9210428595542908
0 references
0.907556653022766
0 references
Augmenting a (\(k\)-1)-vertex-connected multigraph to an \(l\)-edge-connected and \(k\)-vertex-connected multigraph (English)
0 references
It is shown that any \((k-1)\)-vertex connected multigraph, \(k>3\), can be made \(k\)-vertex connected and \(l\)-edge connected, by adding at most \(2l\) more edges than the optimum number of edges for the operation, in a polynomial time with respect to the number of vertices of the multigraph. For the entire collection see [Zbl 0918.00032].
0 references
