Untangling circular drawings: algorithms and complexity (Q6101838)

From MaRDI portal
Revision as of 10:08, 1 August 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    title
    Untangling circular drawings: algorithms and complexity (English)
    0 references
    author
    Sujoy Bhore
    0 references
    Guangping Li
    0 references
    Martin Nöllenburg
    0 references
    Ignaz Rutter
    0 references
    Hsiang-Yun Wu
    0 references
    publication date
    20 June 2023
    0 references
    zbMATH Keywords
    straight-line graph drawing
    0 references
    outerplanarity
    0 references
    NP-hardness
    0 references
    untangling
    0 references
    permutations
    0 references

    Identifiers

    arXiv ID
    2111.09766
    0 references
    Mathematics Subject Classification ID
    05C62
    0 references
    68R10
    0 references
    68Q17
    0 references
    zbMATH DE Number
    7699083
    0 references
    OpenAlex ID
    W3215529594
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6101838&oldid=37526896"
    Powered by MediaWiki