Graph Stories in Small Area
From MaRDI portal
Publication:5119379
DOI10.7155/jgaa.00530zbMath1447.05141arXiv1908.09318OpenAlexW3023963925MaRDI QIDQ5119379
Giuseppe Di Battista, Manuel Borrazzo, Fabrizio Frati, Maurizio Patrignani, Giordano Da Lozzo
Publication date: 4 September 2020
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.09318
Related Items (5)
On the complexity of the storyplan problem ⋮ On the complexity of the storyplan problem ⋮ Small Point-Sets Supporting Graph Stories ⋮ Small point-sets supporting graph stories ⋮ A Tipping Point for the Planarity of Small and Medium Sized Graphs
Cites Work
- Drawing trees in a streaming model
- How to draw a planar graph on a grid
- On simultaneous planar graph embeddings
- Incremental convex planarity testing
- Planarity of streamed graphs
- Streamed Graph Drawing and the File Maintenance Problem
- Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
- Offline Drawing of Dynamic Trees: Algorithmics and Document Integration
- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
- On-Line Planarity Testing
- Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- Graph Drawing
- Hierarchical partial planarity
This page was built for publication: Graph Stories in Small Area
