Small point-sets supporting graph stories
From MaRDI portal
Publication:6172204
DOI10.1007/978-3-031-22203-0_21arXiv2208.14126MaRDI QIDQ6172204
Luca Grilli, Maurizio Patrignani, Alessandra Tappini, Giacomo Ortali, Fabrizio Grosso, Walter Didimo, Giuseppe Di Battista
Publication date: 16 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.14126
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
- On simultaneous planar graph embeddings
- Drawing colored graphs on colored points
- Incremental convex planarity testing
- Planarity of streamed graphs
- Alpha-algorithms for incremental planarity testing (preliminary version)
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Streamed Graph Drawing and the File Maintenance Problem
- Offline Drawing of Dynamic Trees: Algorithmics and Document Integration
- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
- Congruent Graphs and the Connectivity of Graphs
- On-Line Planarity Testing
- Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
- Graph Stories in Small Area
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- Drawing Partially Embedded and Simultaneously Planar Graphs
- Embedding planar graphs at fixed vertex locations
- Small point-sets supporting graph stories
This page was built for publication: Small point-sets supporting graph stories
