Graph isomorphism parameterized by elimination distance to bounded degree (Q309797)

From MaRDI portal
Revision as of 12:50, 12 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
Graph isomorphism parameterized by elimination distance to bounded degree
scientific article

    Statements

    Graph isomorphism parameterized by elimination distance to bounded degree (English)
    0 references
    0 references
    0 references
    0 references
    7 September 2016
    0 references
    graph isomorphism
    0 references
    canonization
    0 references
    parameterized complexity
    0 references
    fixed-parameter tractable
    0 references
    bounded degree
    0 references
    graph theory
    0 references
    complexity theory
    0 references
    tree-depth
    0 references

    Identifiers