TY  - GEN
ID  - gdea_3599
UR  - http://gdea.informatik.uni-koeln.de/599/
A1  - Kitching, Matthew
A1  - Whitesides, Sue
Y1  - 2004///
N2  - 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.
PB  - Springer
TI  - The Three Dimensional Logic Engine
SP  - 329
AV  - none
EP  - 339
ER  -