A Blossom Algorithm for Maximum Edge-Disjoint <i>T</i>-Paths (Q5146904)
From MaRDI portal
!
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 7304142
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Blossom Algorithm for Maximum Edge-Disjoint <i>T</i>-Paths |
scientific article; zbMATH DE number 7304142 |
Statements
A Blossom Algorithm for Maximum Edge-Disjoint <i>T</i>-Paths (English)
0 references
2 February 2021
0 references
