Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Hardness and efficiency on minimizing maximum distances in spanning trees
scientific article

    Statements

    Hardness and efficiency on minimizing maximum distances in spanning trees (English)
    0 references
    0 references
    0 references
    1 September 2020
    0 references
    3-admissibility
    0 references
    stretch index
    0 references
    graphs with few \(P_4\)s
    0 references
    \((k, \ell)\)-graphs
    0 references
    \((2, 1)\)-chordal graphs
    0 references
    P vs NP-complete dichotomy
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references