Pages that link to "Item:Q1085168"
From MaRDI portal
The following pages link to Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168):
Displaying 50 items.
- Area requirement of visibility representations of trees (Q287042) (← links)
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes (Q306259) (← links)
- Compact visibility representation of 4-connected plane graphs (Q443715) (← links)
- Minimum covering with travel cost (Q454247) (← links)
- Colored simultaneous geometric embeddings and universal pointsets (Q548667) (← links)
- The minimum broadcast time problem for several processor networks (Q672455) (← links)
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- One strike against the min-max degree triangulation problem (Q685602) (← links)
- Reconstructing sets of orthogonal line segments in the plane (Q688265) (← links)
- The one-round Voronoi game replayed (Q705543) (← links)
- Improved visibility representation of plane graphs (Q706721) (← links)
- Closed rectangle-of-influence drawings for irreducible triangulations (Q709065) (← links)
- Planar bus graphs (Q724233) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- Base-object location problems for base-monotone regions (Q744059) (← links)
- How to draw a planar graph on a grid (Q804582) (← links)
- Visibility representations of four-connected plane graphs with near optimal heights (Q833713) (← links)
- On simultaneous straight-line grid embedding of a planar graph and its dual (Q845659) (← links)
- Good spanning trees in graph drawing (Q897943) (← links)
- L-visibility drawings of IC-planar graphs (Q903189) (← links)
- Dynamic maintenance of planar digraphs, with applications (Q911751) (← links)
- Multilayer grid embeddings for VLSI (Q916362) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- Algorithms for computing a parameterized \(st\)-orientation (Q959815) (← links)
- Optimal \(st\)-orientations for plane triangulations (Q1029266) (← links)
- Three results on frequency assignment in linear cellular networks (Q1041229) (← links)
- Visibility representation of plane graphs via canonical ordering tree (Q1044700) (← 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)
- Testing approximate symmetry in the plane is NP-hard (Q1176235) (← links)
- Constrained visibility representations of graphs (Q1186563) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- Constructing compact rectilinear planar layouts using canonical representation of planar graphs (Q1193898) (← links)
- Drawing the planar dual (Q1198002) (← links)
- Detecting and decomposing self-overlapping curves (Q1200911) (← links)
- Some results on visibility graphs (Q1201816) (← links)
- Geometric three-dimensional assignment problems (Q1278259) (← links)
- The complexity of detecting crossingfree configurations in the plane (Q1317860) (← links)
- Grid embedding of 4-connected plane graphs (Q1355197) (← links)
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems (Q1392021) (← links)
- Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
- 3-coloring arrangements of line segments with 4 slopes is hard (Q1641160) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity (Q1725786) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- Bipolar orientations revisited (Q1842650) (← links)
- A left-first search algorithm for planar graphs (Q1892422) (← links)
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (Q1892581) (← links)
