Pages that link to "Item:Q3338119"
From MaRDI portal
The following pages link to On minimal-node-cost planar embeddings (Q3338119):
Displaying 27 items.
- Bend-optimal orthogonal graph drawing in the general position model (Q390165) (← links)
- A polynomial upper bound on Reidemeister moves (Q499087) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Octagonal drawings of plane graphs with prescribed face areas (Q1000923) (← links)
- A unified approach to visibility representations of planar graphs (Q1085167) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Lower bounds for planar orthogonal drawings of graphs (Q1182115) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets (Q1370934) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- Algorithms for area-efficient orthogonal drawing (Q1384191) (← links)
- A better heuristic for orthogonal graph drawings (Q1384200) (← links)
- Rectangular grid drawings of plane graphs (Q1392851) (← links)
- Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
- Untangling planar curves (Q1688858) (← links)
- Drawing graphs on rectangular grids (Q1902892) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- Optimal two-sided embeddings of complete binary trees in rectangular grids (Q2332034) (← links)
- Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations (Q2867674) (← links)
- Overloaded Orthogonal Drawings (Q3223958) (← links)
- How to draw a hypergraph (Q3477978) (← links)
- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract) (Q5060109) (← links)
- Orthogonal drawing of high degree graphs with small area and few bends (Q5096952) (← links)
- Algorithm Theory - SWAT 2004 (Q5315377) (← links)
- The DFS-heuristic for orthogonal graph drawing (Q5943316) (← links)
