A fast algorithm for cactus representations of minimum cuts (Q2258383): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:29, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for cactus representations of minimum cuts |
scientific article |
Statements
A fast algorithm for cactus representations of minimum cuts (English)
0 references
3 March 2015
0 references
undirected network
0 references
cactus representation
0 references
minimum cut
0 references
maximum flow
0 references
graph algorithm
0 references
