Finding Maximum Edge-Disjoint Paths Between Multiple Terminals (Q6057790)
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 7755476
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Maximum Edge-Disjoint Paths Between Multiple Terminals |
scientific article; zbMATH DE number 7755476 |
Statements
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals (English)
0 references
26 October 2023
0 references
combinatorial optimization
0 references
blossom algorithm
0 references
multicommodity flow
0 references
0 references
0 references
0.7845395803451538
0 references
0.7836859226226807
0 references
0.7778902053833008
0 references
0.7710250020027161
0 references
0.7599431872367859
0 references
