An $\NC$ Algorithm for Minimum Cuts (Q4337444): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: David R. Karger / rank | |||
| Property / author | |||
| Property / author: Q679449 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56114901 / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: David R. Karger / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Rajeev Motwani / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:23, 5 March 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
