Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868)

From MaRDI portal
Revision as of 14:30, 11 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Additive sparse spanners for graphs with bounded length of largest induced cycle
scientific article

    Statements

    Additive sparse spanners for graphs with bounded length of largest induced cycle (English)
    0 references
    0 references
    0 references
    0 references
    29 December 2005
    0 references
    0 references
    additive graph spanners
    0 references
    efficient algorithms
    0 references
    \(k\)-chordal graphs
    0 references
    distance
    0 references
    0 references