An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph (Q1322395): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the complexity of partitioning graphs into connected subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4168622 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A homology theory for spanning tress of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3309631 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank | |||
Normal rank | |||
Latest revision as of 15:34, 22 May 2024
scientific article
| 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 |
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
