The maximum edge-disjoint paths problem in complete graphs (Q930909)
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: The maximum edge-disjoint paths problem in complete graphs |
scientific article; zbMATH DE number 5292244
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum edge-disjoint paths problem in complete graphs |
scientific article; zbMATH DE number 5292244 |
Statements
The maximum edge-disjoint paths problem in complete graphs (English)
0 references
24 June 2008
0 references
graph algorithms
0 references
edge-disjoint paths
0 references
complete graph
0 references
0 references
0.9493629336357116
0 references
0.8466516137123108
0 references
0.8192954063415527
0 references
0.8184656500816345
0 references
