Area requirement and symmetry display of planar upward drawings
From MaRDI portal
(Redirected from Publication:1189288)
Recommendations
- On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
- scientific article; zbMATH DE number 4062623
- scientific article; zbMATH DE number 68923
- PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
Cites work
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 432821 (Why is no real title available?)
- scientific article; zbMATH DE number 4006289 (Why is no real title available?)
- scientific article; zbMATH DE number 3786844 (Why is no real title available?)
- scientific article; zbMATH DE number 3509333 (Why is no real title available?)
- scientific article; zbMATH DE number 4114655 (Why is no real title available?)
- scientific article; zbMATH DE number 6157237 (Why is no real title available?)
- scientific article; zbMATH DE number 3315017 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- A Depth-First-Search Characterization of Planarity
- A linear algorithm for embedding planar graphs using PQ-trees
- A unified approach to visibility representations of planar graphs
- Algorithms for drawing graphs: An annotated bibliography
- Algorithms for plane representations of acyclic digraphs
- Bipartite graphs, upward drawings, and planarity
- Convex Maps
- Drawing plane graphs nicely
- Dynamic maintenance of planar digraphs, with applications
- Efficient Planarity Testing
- Fast detection and display of symmetry in outerplanar graphs
- Fundamentals of planar ordered sets
- How to Draw a Graph
- How to draw a planar graph on a grid
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On minimal-node-cost planar embeddings
- On the vector representation of the reachability in planar directed graphs
- Planar Lattices
- Planar acyclic oriented graphs
- Planar lattices and planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Representing orders on the plane by translating convex figures
- The complexity of drawing trees nicely
Cited in
(52)- Towards area requirements for drawing hierarchically planar graphs
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- A more compact visibility representation
- Right Angle Crossing Drawings of Graphs
- Upward drawings of triconnected digraphs.
- On the enumeration of plane bipolar posets and transversal structures
- Upward straight-line embeddings of directed graphs into point sets
- Three-dimensional graph drawing
- Succinct greedy drawings do not always exist
- Upward planar morphs
- Minimum-width grid drawings of plane graphs
- Proximity drawings in polynomial area and volume
- Upward planar morphs
- \(st\)-orientations with few transitive edges
- $st$-Orientations with Few Transitive Edges
- Bitonic \(st\)-orderings for upward planar graphs
- Area requirement of visibility representations of trees
- scientific article; zbMATH DE number 1858605 (Why is no real title available?)
- New results on drawing angle graphs
- How to draw a series-parallel digraph
- Dominance drawings for DAGs with bounded modular width
- Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario
- Overloaded orthogonal drawings
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
- A Sublinear Bound on the Page Number of Upward Planar Graphs
- Straight-Line Drawability of a Planar Graph Plus an Edge
- scientific article; zbMATH DE number 68923 (Why is no real title available?)
- Volume requirements of 3D upward drawings
- Upward book embeddings of st-graphs
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- On upward-planar L-drawings of graphs
- Maximum upward planar subgraphs of embedded planar digraphs
- 4-connected triangulations on few lines
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- Advances in the theory and practice of graph drawing
- Baxter permutations and plane bipolar orientations
- Upward planarity testing
- A fixed-parameter algorithm for dominance drawings of DAGs
- Spring algorithms and symmetry
- Drawing directed acyclic graphs: an experimental study
- Upward planar drawings with two slopes
- Drawing planar graphs using the canonical ordering
- How to draw a planar clustered graph
- How to draw a clustered tree
- A linear algorithm to decompose inheritance graphs into modules
- Monotone drawings of graphs with few directions
- The strength of weak proximity
- Bipolar orientations revisited
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
- Upward planar drawings on the standing and the rolling cylinders
- A force-directed algorithm for drawing directed graphs symmetrically
This page was built for publication: Area requirement and symmetry display of planar upward drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1189288)
