The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems

Fekete, Sándor P. and Houle, Michael E. and Whitesides, Sue (1998) The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 272-283(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_69).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-63938-1_69
Classifications: G Algorithms and Complexity > G.999 Others
P Styles > P.900 Visibility
G Algorithms and Complexity > G.560 Geometry
URI: http://gdea.informatik.uni-koeln.de/id/eprint/91

Actions (login required)

View Item View Item