Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees (Q975474)
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: Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees |
scientific article; zbMATH DE number 5719200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees |
scientific article; zbMATH DE number 5719200 |
Statements
Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees (English)
0 references
9 June 2010
0 references
algorithms
0 references
analysis of algorithms
0 references
data structures
0 references
0 references
0.8994377851486206
0 references
0.813127875328064
0 references
0.8080195188522339
0 references
0.7813249230384827
0 references
0.7761635184288025
0 references
