An efficient \({\mathcal {NC}}\) algorithm for a sparse \(k\)-edge-connectivity certificate (Q2729643)
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 1623121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient \({\mathcal {NC}}\) algorithm for a sparse \(k\)-edge-connectivity certificate |
scientific article; zbMATH DE number 1623121 |
Statements
23 July 2001
0 references
graph algorithms
0 references
spanning forests
0 references
\(k\)-edge-connectivity certificate
0 references
An efficient \({\mathcal {NC}}\) algorithm for a sparse \(k\)-edge-connectivity certificate (English)
0 references
0.803187906742096
0 references
0.8027570247650146
0 references
0.7945919632911682
0 references
