I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs (Q2339449)
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 6422084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs |
scientific article; zbMATH DE number 6422084 |
Statements
I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs (English)
0 references
1 April 2015
0 references
graph algorithm
0 references
external memory algorithm
0 references
I/O complexity
0 references
minimum cut
0 references
lower bound
0 references
0 references
0.99999976
0 references
0.8905338
0 references
0.8861215
0 references
0.8850951
0 references
0.8831012
0 references
0.8806547
0 references
0.8795316
0 references
0.87862164
0 references
