The logic engine and the realization problem for nearest neighbor graphs
From MaRDI portal
Recommendations
Cites work
- Algorithms for drawing graphs: An annotated bibliography
- Computing proximity drawings of trees in the 3-dimensional space
- Fixed edge-length graph drawing is NP-hard
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Realizability of Delaunay triangulations
- The complexity of minimizing wire lengths in VLSI layouts
- The realization problem for Euclidean minimum spanning trees is NP-hard
- Unit-length embedding of binary trees on a square grid
Cited in
(18)- On complexity of multidistance graph recognition in \(\mathbb{R}^1\)
- On arrangements of orthogonal circles
- Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges
- On the computational complexity of degenerate unit distance representations of graphs
- Isometric Diamond Subgraphs
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
- Nearest neighbour graph realizability is NP-hard
- Complexity dichotomy on partial grid recognition
- Graph Drawing
- How to fit a tree in a box
- On the Colin de Verdière graph number and penny graphs
- Approximate counting for spin systems in sub-quadratic time
- On the complexity of embedding in graph products
- On the uniqueness of collections of pennies and marbles
- Approximate counting for spin systems in sub-quadratic time
- Embedding graphs as Euclidean kNN-graphs
- The strength of weak proximity
- Complexity results for three-dimensional orthogonal graph drawing
This page was built for publication: The logic engine and the realization problem for nearest neighbor graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349880)
