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


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… (More)
DOI: 10.1007/3-540-63938-1_69


7 Figures and Tables


Citations per Year

Citation Velocity: 6

Averaging 6 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics