An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106)

From MaRDI portal
Revision as of 02:09, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
scientific article

    Statements

    An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 September 2018
    0 references
    shortest path problem
    0 references
    rooted trees
    0 references
    network improvement problem
    0 references
    Hamming distance
    0 references
    dynamic programming
    0 references

    Identifiers