Faster cut-equivalent trees in simple graphs (Q6560908)
From MaRDI portal
!
WARNING
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 7870319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster cut-equivalent trees in simple graphs |
scientific article; zbMATH DE number 7870319 |
Statements
Faster cut-equivalent trees in simple graphs (English)
0 references
24 June 2024
0 references
graph algorithms
0 references
minimum cuts
0 references
max-flow
0 references
