How to use spanning trees to navigate in graphs (Q2375948)

From MaRDI portal
Revision as of 14:30, 6 July 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
How to use spanning trees to navigate in graphs
scientific article

    Statements

    How to use spanning trees to navigate in graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    navigating in graphs
    0 references
    spanning trees
    0 references
    routing in graphs
    0 references
    distances
    0 references
    ancestry
    0 references
    \(k\)-chordal graphs
    0 references
    tree-length \(\lambda\) graphs
    0 references
    \(\delta\)-hyperbolic graphs
    0 references
    lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references