The complexity of detecting crossingfree configurations in the plane (Q1317860)

From MaRDI portal
Revision as of 12:01, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The complexity of detecting crossingfree configurations in the plane
scientific article

    Statements

    The complexity of detecting crossingfree configurations in the plane (English)
    0 references
    0 references
    0 references
    0 references
    22 March 1994
    0 references
    algorithmic complexity
    0 references
    planar layouts
    0 references
    geometry
    0 references
    computational complexity
    0 references
    crossingfree spanning trees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references