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

From MaRDI portal
Revision as of 02:55, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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