Pages that link to "Item:Q1349880"
From MaRDI portal
The following pages link to The logic engine and the realization problem for nearest neighbor graphs (Q1349880):
Displaying 8 items.
- Complexity dichotomy on partial grid recognition (Q533881) (← links)
- The strength of weak proximity (Q849629) (← links)
- Complexity results for three-dimensional orthogonal graph drawing (Q954967) (← links)
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
- On arrangements of orthogonal circles (Q2206852) (← links)
- Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges (Q2883585) (← links)
- On the Computational Complexity of Degenerate Unit Distance Representations of Graphs (Q3000515) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
