<ctx:context-object xmlns:xsi="http://www.w3.org/2001/XML" xmlns:ctx="info:ofi/fmt:xml:xsd:ctx" timestamp="2008-09-18T11:08:55Z" xsi:schemaLocation="info:ofi/fmt:xml:xsd:ctx http://www.openurl.info/registry/docs/info:ofi/fmt:xml:xsd:ctx"><ctx:referent><ctx:identifier>info:oai:generic.eprints.org:599</ctx:identifier><ctx:metadata-by-val><ctx:format>info:ofi/fmt:xml:xsd:oai_dc</ctx:format><ctx:metadata><oai_dc:dc xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/">
        <dc:title>The Three Dimensional Logic Engine</dc:title>
        <dc:creator>Kitching, Matthew</dc:creator>
        <dc:creator>Whitesides, Sue</dc:creator>
        <dc:subject>Z.250 Geometry</dc:subject>
        <dc:description>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.</dc:description>
        <dc:publisher>Springer</dc:publisher>
        <dc:contributor>Pach, János</dc:contributor>
        <dc:date>2004</dc:date>
        <dc:type>Conference Paper</dc:type>
        <dc:type>NonPeerReviewed</dc:type>
        <dc:identifier>Kitching, Matthew and Whitesides, Sue (2004) The Three Dimensional Logic Engine. [Conference Paper]</dc:identifier>
        <dc:relation>http://gdea.informatik.uni-koeln.de/599/</dc:relation></oai_dc:dc></ctx:metadata></ctx:metadata-by-val></ctx:referent></ctx:context-object>