The complexity of detecting crossingfree configurations in the plane
type: Item
instance of: scholarly article
title: The complexity of detecting crossingfree configurations in the plane
zbMATH Open document ID: 0797.68080
DOI: 10.1007/BF01990536
author: Klaus Jansen
author: Gerhard J. Woeginger
published in: BIT
publication date: 1994-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 536861
zbMATH Keywords: algorithmic complexity
zbMATH Keywords: planar layouts
zbMATH Keywords: geometry
zbMATH Keywords: computational complexity
zbMATH Keywords: crossingfree spanning trees
MaRDI profile type: Publication
cites work: Q4198056
cites work: Noncrossing Subgraphs in Topological Layouts
cites work: Q3997942
cites work: Reconstructing sets of orthogonal line segments in the plane
cites work: Rectilinear planar layouts and bipolar orientations of planar graphs
cites work: Information Dissemination in Trees
full work available at URL: https://doi.org/10.1007/bf01990536
OpenAlex ID: W2127145740
description: scientific article; zbMATH DE number 536861