Pages that link to "Item:Q533881"
From MaRDI portal
The following pages link to Complexity dichotomy on partial grid recognition (Q533881):
Displaying 5 items.
- Unit-length embedding of binary trees on a square grid (Q1120274) (← links)
- Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges (Q2883585) (← links)
- Enumerating Grid Layouts of Graphs (Q5119387) (← links)
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5896079) (← links)
- On central placements of new vertices in a planar point set (Q6652475) (← links)