Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees (Q975474): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 20:49, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees |
scientific article |
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