Testing gap \(k\)-planarity is NP-complete (Q2032139): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3126317692 / rank
 
Normal rank

Revision as of 18:16, 19 March 2024

scientific article
Language Label Description Also known as
English
Testing gap \(k\)-planarity is NP-complete
scientific article

    Statements

    Testing gap \(k\)-planarity is NP-complete (English)
    0 references
    0 references
    0 references
    16 June 2021
    0 references
    combinatorial problems
    0 references
    graph drawing
    0 references
    local crossing number
    0 references
    crossing number
    0 references
    gap \(k\)-planarity
    0 references

    Identifiers