An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph (Q1322395)
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: An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph |
scientific article; zbMATH DE number 562829
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph |
scientific article; zbMATH DE number 562829 |
Statements
An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph (English)
0 references
5 May 1994
0 references
graph algorithm
0 references
graph vertex connectivity
0 references
\(k\)-partition of graph
0 references
