Edge-disjoint paths in digraphs with bounded independence number (Q473097)
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: Edge-disjoint paths in digraphs with bounded independence number |
scientific article; zbMATH DE number 6371810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-disjoint paths in digraphs with bounded independence number |
scientific article; zbMATH DE number 6371810 |
Statements
Edge-disjoint paths in digraphs with bounded independence number (English)
0 references
21 November 2014
0 references
disjoint paths
0 references
digraphs
0 references
tournaments
0 references
linking problem
0 references
polynomial-time algorithm
0 references
independence number
0 references
0.770966112613678
0 references
0.7640727758407593
0 references
0.7626150250434875
0 references
0.7616315484046936
0 references
0.7556178569793701
0 references
