On upward-planar L-drawings of graphs
From MaRDI portal
Publication:6616232
DOI10.7155/JGAA.V28I1.2950MaRDI QIDQ6616232
Giordano Da Lozzo, Sabine Cornelsen, Steven Chaplick, Patrizio Angelini
Publication date: 8 October 2024
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Upward drawings of triconnected digraphs.
- Algorithms for plane representations of acyclic digraphs
- Area requirement and symmetry display of planar upward drawings
- An SPQR-tree-like embedding representation for upward planarity
- On the computational complexity of upward and rectilinear planarity testing
- Bitonic st-orderings for Upward Planar Graphs
- Upward Spirality and Upward Planarity Testing
- Algorithms and Bounds for L-Drawings of Directed Graphs
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Upward Planar Drawing of Single-Source Acyclic Digraphs
- Planar L-Drawings of Bimodal Graphs
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
- Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
- Testing upward planarity of partial 2-trees
- Parameterized algorithms for upward planarity
- On upward-planar L-drawings of graphs
This page was built for publication: On upward-planar L-drawings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616232)
