Skip to main content

1997 | ReviewPaper | Buchkapitel

The wobbly logic engine: Proving hardness of non-rigid geometric graph representation problems

Extended abstract

verfasst von : Sándor P. Fekete, Michael E. Houle, Sue Whitesides

Erschienen in: Graph Drawing

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

The logic engine technique has been used in the past to establish the NP-hardness of a number of graph representations. The original technique can only be applied in those situations in which subgraphs exist for which the only possible layouts are rigid. In this paper we introduce an extension called the wobbly logic engine which can be used to prove the NP-hardness of several graph representations for which no such rigid layouts exist, representations by visibility and intersection in particular. We illustrate the method by using the wobbly technique to show the NP-hardness of deciding whether a graph has a nondegenerate z-axis parallel visibility representation (ZPR) by unit squares.

Metadaten
Titel
The wobbly logic engine: Proving hardness of non-rigid geometric graph representation problems
verfasst von
Sándor P. Fekete
Michael E. Houle
Sue Whitesides
Copyright-Jahr
1997
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3-540-63938-1_69

Neuer Inhalt