A new algorithm to determine minimally \(k\)-edge-connected graphs with odd \(k\) (Q4925419)
From MaRDI portal
!
WARNING
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 6174314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm to determine minimally \(k\)-edge-connected graphs with odd \(k\) |
scientific article; zbMATH DE number 6174314 |
Statements
A new algorithm to determine minimally k-edgeconnected graphs with odd k (English)
0 references
12 June 2013
0 references
edge connectivity
0 references
minimally edge-connected
0 references
divide-and-conquer algorithm
0 references
time complexity
0 references
0.7898916006088257
0 references
0.7889546155929565
0 references
0.7863215804100037
0 references
0.7795330882072449
0 references
