A Preemptive Algorithm for Maximizing Disjoint Paths on Trees (Q3512469)
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: A Preemptive Algorithm for Maximizing Disjoint Paths on Trees |
scientific article; zbMATH DE number 5301081
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Preemptive Algorithm for Maximizing Disjoint Paths on Trees |
scientific article; zbMATH DE number 5301081 |
Statements
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees (English)
0 references
15 July 2008
0 references
0 references
0.9937687516212464
0 references
0.8513163328170776
0 references
