Pages that link to "Item:Q1085168"
From MaRDI portal
The following pages link to Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168):
Displayed 43 items.
- 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)
- How to draw a planar graph on a grid (Q804582) (← links)
- Dynamic maintenance of planar digraphs, with applications (Q911751) (← links)
- Multilayer grid embeddings for VLSI (Q916362) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- Algorithms for computing a parameterized \(st\)-orientation (Q959815) (← 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)
- 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)
- Determining bar-representability for ordered weighted graphs (Q1917046) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- An experimental comparison of four graph drawing algorithms. (Q2482890) (← links)
- THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING (Q2708038) (← links)
- DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY (Q2708043) (← links)
- On Representation of Planar Graphs by Segments (Q3511438) (← links)
- Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights (Q3611838) (← links)
- On Triangle Contact Graphs (Q4305318) (← links)
- (Q4789076) (← links)
- On the net-embeddability of graphs (Q5288744) (← links)
- Width-Optimal Visibility Representations of Plane Graphs (Q5387754) (← links)
- Representation of Planar Hypergraphs by Contacts of Triangles (Q5452217) (← links)
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING (Q5493898) (← links)
- The DFS-heuristic for orthogonal graph drawing (Q5943316) (← links)