Graph stories in small area
From MaRDI portal
Publication:2206885
DOI10.1007/978-3-030-35802-0_41OpenAlexW2989571499MaRDI QIDQ2206885
Giordano Da Lozzo, Maurizio Patrignani, Manuel Borrazzo, Fabrizio Frati
Publication date: 26 October 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-35802-0_41
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
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
- Alpha-algorithms for incremental planarity testing (preliminary version)
- 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*
- Hierarchical partial planarity
This page was built for publication: Graph stories in small area
