Pages that link to "Item:Q1920421"
From MaRDI portal
The following pages link to The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421):
Displaying 17 items.
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Drawing a tree as a minimum spanning tree approximation (Q414909) (← links)
- Complexity dichotomy on partial grid recognition (Q533881) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- The strength of weak proximity (Q849629) (← links)
- Complexity results for three-dimensional orthogonal graph drawing (Q954967) (← links)
- The logic engine and the realization problem for nearest neighbor graphs (Q1349880) (← links)
- On nearest-neighbor graphs (Q1355198) (← links)
- The rectangle of influence drawability problem (Q1388129) (← links)
- Voronoi drawings of trees (Q1869748) (← links)
- Proximity drawings in polynomial area and volume (Q1882852) (← links)
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree (Q2224848) (← links)
- Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges (Q2883585) (← links)
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (Q3459369) (← links)
- Nearest neighbour graph realizability is NP-hard (Q5096336) (← links)
- Polynomial Area Bounds for MST Embeddings of Trees (Q5452214) (← links)
- The drawability problem for minimum weight triangulations (Q5958308) (← links)
