Pages that link to "Item:Q673676"
From MaRDI portal
The following pages link to A linear-time algorithm for drawing a planar graph on a grid (Q673676):
Displaying 39 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- Small grid drawings of planar graphs with balanced partition (Q695321) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (Q834906) (← links)
- On simultaneous straight-line grid embedding of a planar graph and its dual (Q845659) (← links)
- Small area drawings of outerplanar graphs (Q1024211) (← links)
- Minimum-width grid drawings of plane graphs (Q1265328) (← links)
- Grid embedding of 4-connected plane graphs (Q1355197) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394) (← links)
- Arc diagrams, flip distances, and Hamiltonian triangulations (Q1699291) (← links)
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (Q1741861) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- Metric dimension of maximal outerplanar graphs (Q2045286) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q2169950) (← links)
- Grid drawings of graphs with constant edge-vertex resolution (Q2230412) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
- Fair redistricting is hard (Q2272397) (← links)
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees (Q2396907) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- Optimal polygonal representation of planar graphs (Q2429359) (← links)
- An experimental comparison of four graph drawing algorithms. (Q2482890) (← links)
- Feedback vertex set on Hamiltonian graphs (Q2672436) (← links)
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints (Q3611859) (← links)
- Drawing Planar Graphs with Few Geometric Primitives (Q4585062) (← links)
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS (Q4675884) (← links)
- A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems (Q5050764) (← links)
- The Complexity of Several Realizability Problems for Abstract Topological Graphs (Q5452218) (← links)
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS (Q5493893) (← links)
- Computing cartograms with optimal complexity (Q5891266) (← links)
- Compact drawings of 1-planar graphs with right-angle crossings and few bends (Q5915941) (← links)
- Universal slope sets for upward planar drawings (Q5918782) (← links)
- Drawing planar graphs with circular arcs (Q5944937) (← links)
- Straight-line drawings of 1-planar graphs (Q6049552) (← links)
- An exponential bound for simultaneous embeddings of planar graphs (Q6063275) (← links)
- On the complexity of the storyplan problem (Q6078287) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q6199406) (← links)
