Pages that link to "Item:Q809088"
From MaRDI portal
The following pages link to General theoretical results on rectilinear embeddability of graphs (Q809088):
Displaying 14 items.
- Graphs of edge-intersecting and non-splitting paths (Q288788) (← links)
- Theoretical results on at most 1-bend embeddability of graphs (Q1210238) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- At most single-bend embeddings of cubic graphs (Q1335404) (← links)
- Single bend wiring on surfaces (Q1348375) (← links)
- A graph partition problem (Q1367109) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- A better heuristic for orthogonal graph drawings (Q1384200) (← links)
- Boolean approaches to graph embeddings related to VLSI (Q1609705) (← links)
- An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid (Q1827866) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- A graph theoretical approach to the firebreak locating problem (Q2124231) (← links)
- A robust \(p\)-center problem under pressure to locate shelters in wildfire context (Q2195562) (← links)
- (Q2741461) (← links)
