Approximate max-flow min-multicut theorem for graphs of bounded treewidth (Q6499306)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate max-flow min-multicut theorem for graphs of bounded treewidth |
scientific article; zbMATH DE number 7844674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate max-flow min-multicut theorem for graphs of bounded treewidth |
scientific article; zbMATH DE number 7844674 |
Statements
Approximate max-flow min-multicut theorem for graphs of bounded treewidth (English)
0 references
8 May 2024
0 references
approximation algorithm
0 references
max-flow min-multicut theorem
0 references
small diameter decomposition
0 references
0 references
0 references
0 references
