An $\NC$ Algorithm for Minimum Cuts (Q4337444): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56114901, #quickstatements; #temporary_batch_1705829395789 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56114901 / rank | |||
Normal rank | |||
Revision as of 10:40, 21 January 2024
scientific article; zbMATH DE number 1011180
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $\NC$ Algorithm for Minimum Cuts |
scientific article; zbMATH DE number 1011180 |
Statements
An $\NC$ Algorithm for Minimum Cuts (English)
0 references
7 September 1997
0 references
minimum-cut problem
0 references
weighted undirected graphs
0 references
set-isolation problem
0 references
sparse \(k\)- connectivity certificate
0 references
