Subexponential-time and FPT algorithms for embedded flat clustered planarity (Q1627160)

From MaRDI portal
Revision as of 10:35, 24 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Subexponential-time and FPT algorithms for embedded flat clustered planarity
scientific article

    Statements

    Subexponential-time and FPT algorithms for embedded flat clustered planarity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 November 2018
    0 references

    Identifiers