The Three Dimensional Logic Engine

11 years 7 months ago
The Three Dimensional Logic Engine
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor graph of the set P of points to which the vertices are mapped? We show that this problem is NP-hard. We do this by extending the “logic engine” method to three dimensions by using building blocks inpired by the structure of diamond and by constructions of A.G. Bell and B. Fuller.
Matthew Kitching, Sue Whitesides
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where GD
Authors Matthew Kitching, Sue Whitesides
Comments (0)