The complexity of detecting crossingfree configurations in the plane (Q1317860): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Noncrossing Subgraphs in Topological Layouts / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3997942 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reconstructing sets of orthogonal line segments in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rectilinear planar layouts and bipolar orientations of planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Information Dissemination in Trees / rank | |||
Normal rank | |||
Revision as of 12:43, 22 May 2024
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
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
