Pages that link to "Item:Q4504999"
From MaRDI portal
The following pages link to A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs (Q4504999):
Displaying 25 items.
- Octagonal drawings of plane graphs with prescribed face areas (Q1000923) (← links)
- Orthogonally drawing cubic graphs in parallel (Q1290255) (← links)
- At most single-bend embeddings of cubic graphs (Q1335404) (← links)
- A better heuristic for orthogonal graph drawings (Q1384200) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- Bend-optimal orthogonal drawings of triconnected plane graphs (Q1713568) (← links)
- Bend-minimum orthogonal drawings in quadratic time (Q1725783) (← links)
- Quasi-upward planar drawings with minimum curve complexity (Q2151443) (← links)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
- On embedding a graph in the grid with the maximum number of bends and other bad features (Q2272195) (← links)
- On orthogonally convex drawings of plane graphs (Q2360858) (← links)
- Drawings of planar graphs with few slopes and segments (Q2385699) (← links)
- Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments (Q2985120) (← links)
- (Q4501695) (← links)
- An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings (Q5014120) (← links)
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time (Q5014135) (← links)
- Optimal orthogonal drawings of triconnected plane graphs (Q5054824) (← links)
- Optimal Orthogonal Graph Drawing with Convex Bend Costs (Q5326560) (← links)
- Graph Drawing (Q5896907) (← links)
- Rectangular drawings of plane graphs without designated corners (Q5959556) (← links)
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time (Q6053468) (← links)
- Sliding column model for t-unit bar visibility representations of graphs (Q6174768) (← links)
- On the parameterized complexity of bend-minimum orthogonal planarity (Q6618248) (← links)
- On the parameterized complexity of bend-minimum orthogonal planarity (Q6623586) (← links)
- Unit-length rectangular drawings of graphs (Q6636988) (← links)
