I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs (Q2339449): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.043 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2108852404 / rank | |||
Normal rank | |||
Revision as of 21:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs |
scientific article |
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
