Minimum cuts in near-linear time (Q5487825)
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 5052708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cuts in near-linear time |
scientific article; zbMATH DE number 5052708 |
Statements
Minimum cuts in near-linear time (English)
0 references
12 September 2006
0 references
time bounds
0 references
minimum cut problem on undirected graphs
0 references
randomized Monte Carlo algorithm
0 references
0.92484426
0 references
0.9197712
0 references
0 references
0 references
0.89793533
0 references
0 references
0 references
