Untangling circular drawings: algorithms and complexity (Q6101838)

From MaRDI portal
Revision as of 14:25, 27 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7699083
Language Label Description Also known as
English
Untangling circular drawings: algorithms and complexity
scientific article; zbMATH DE number 7699083

    Statements

    Untangling circular drawings: algorithms and complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 June 2023
    0 references
    straight-line graph drawing
    0 references
    outerplanarity
    0 references
    NP-hardness
    0 references
    untangling
    0 references
    permutations
    0 references

    Identifiers