A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem (Q5101432)
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 7577908
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem |
scientific article; zbMATH DE number 7577908 |
Statements
A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem (English)
0 references
30 August 2022
0 references
\(k\)-edge-connection
0 references
time augmentation algorithm
0 references
0.8872910737991333
0 references
0.88072669506073
0 references
0.880511462688446
0 references
0.8463173508644104
0 references
