Algorithms for Classes of Graphs with Bounded Expansion (Q5851090)

From MaRDI portal
Revision as of 05:31, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): conf/wg/DvorakK09, #quickstatements; #temporary_batch_1731468600454)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5661043
Language Label Description Also known as
English
Algorithms for Classes of Graphs with Bounded Expansion
scientific article; zbMATH DE number 5661043

    Statements

    Algorithms for Classes of Graphs with Bounded Expansion (English)
    0 references
    0 references
    0 references
    21 January 2010
    0 references
    algorithmic results
    0 references
    sparse graphs
    0 references
    graphs with bounded expansion
    0 references
    nowhere-dense graphs
    0 references
    proper minor-closed classes of graphs
    0 references
    bounded tree-width
    0 references
    locally bounded tree-width
    0 references
    locally excluding a minor
    0 references

    Identifiers