A fast algorithm for the path 2-packing problem (Q2268342)
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 fast algorithm for the path 2-packing problem |
scientific article; zbMATH DE number 5677849
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for the path 2-packing problem |
scientific article; zbMATH DE number 5677849 |
Statements
A fast algorithm for the path 2-packing problem (English)
0 references
5 March 2010
0 references
path packing
0 references
\(T\)-paths
0 references
polynomial-time algorithm
0 references
0 references
0.9906654357910156
0 references
0.7981597781181335
0 references
0.7971328496932983
0 references
0.7952591180801392
0 references
