Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees (Q975474)

From MaRDI portal
Revision as of 03:53, 8 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    9 June 2010
    0 references
    algorithms
    0 references
    analysis of algorithms
    0 references
    data structures
    0 references

    Identifiers