A fast algorithm for cactus representations of minimum cuts (Q2258383): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf03167346 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988832992 / rank | |||
Normal rank | |||
Latest revision as of 08:45, 30 July 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
0 references
