The logic engine and the realization problem for nearest neighbor graphs
type: Item
instance of: scholarly article
title: The logic engine and the realization problem for nearest neighbor graphs
zbMATH Open document ID: 0874.68235
DOI: 10.1016/S0304-3975(97)84223-5
author: Peter Eades
author: Sue Whitesides
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 983805
MaRDI profile type: Publication
cites work: The complexity of minimizing wire lengths in VLSI layouts
cites work: Algorithms for drawing graphs: An annotated bibliography
cites work: Realizability of Delaunay triangulations
cites work: The realization problem for Euclidean minimum spanning trees is NP-hard
cites work: Fixed edge-length graph drawing is NP-hard
cites work: Q4198056
cites work: Unit-length embedding of binary trees on a square grid
cites work: Computing proximity drawings of trees in the 3-dimensional space
full work available at URL: s0304-3975(97)84223-5
OpenAlex ID: W2069814870
description: scientific article; zbMATH DE number 983805