\(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802)

From MaRDI portal
Revision as of 16:48, 10 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
\(k\)-chordal graphs: from cops and robber to compact routing via treewidth
scientific article

    Statements

    title
    \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (English)
    0 references
    author
    Yong-Cai Geng
    0 references
    Sumit K. Garg
    0 references
    published in
    Algorithmica
    0 references
    publication date
    2 September 2015
    0 references
    zbMATH Keywords
    treewidth
    0 references
    chordality
    0 references
    compact routing
    0 references
    cops and robber games
    0 references
    cites work
    Distributed Computing
    0 references
    1-Hyperbolic Graphs
    0 references
    Q3090934
    0 references
    Tandem-win graphs
    0 references
    Q4535803
    0 references
    Q3772406
    0 references
    Q4633929
    0 references
    Q2752024
    0 references
    Q4505399
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C57
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6477673
    0 references
    OpenAlex ID
    W1967614940
    0 references
    Wikidata QID
    Q62046034
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q494802&oldid=36198764"
    Powered by MediaWiki