Pages that link to "Item:Q1827866"
From MaRDI portal
The following pages link to An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid (Q1827866):
Displaying 7 items.
- Orthogonal graph drawing with flexibility constraints (Q476441) (← links)
- Theoretical results on at most 1-bend embeddability of graphs (Q1210238) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- Grid straight-line embeddings of trees with a minimum number of bends per path (Q2059894) (← links)
- A new algorithm for embedding plane graphs at fixed vertex locations (Q2121749) (← links)
- On embedding a graph in the grid with the maximum number of bends and other bad features (Q2272195) (← links)
- An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid (Q2741461) (← links)