Graph Stories in Small Area

DOI10.7155/JGAA.00530MaRDI QIDQ5119379zbMATH OpenOpenAlexFDO

Authors Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani

Publication date 4 September 2020

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1908.09318

zbMATH Keywords

graph stories of pathsgraph stories of trees

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Abstract: We study the problem of drawing a dynamic graph, where each vertex appears in the graph at a certain time and remains in the graph for a fixed amount of time, called the window size. This defines a graph story, i.e., a sequence of subgraphs, each induced by the vertices that are in the graph at the same time. The drawing of a graph story is a sequence of drawings of such subgraphs. To support readability, we require that each drawing is straight-line and planar and that each vertex maintains its placement in all the drawings. Ideally, the area of the drawing of each subgraph should be a function of the window size, rather than a function of the size of the entire graph, which could be too large. We show that the graph stories of paths and trees can be drawn on a $2Wimes2W$ and on an $(8W+1)imes(8W+1)$ grid, respectively, where $W$ is the window size. These results are constructive and yield linear-time algorithms. Further, we show that there exist graph stories of planar graphs whose subgraphs cannot be drawn within an area that is only a function of $W$.

Recommendations

• Graph stories in small area
• Small point-sets supporting graph stories
• Small Point-Sets Supporting Graph Stories
• Graphs of small dimensions
• Graphs with small boundary
• Small area drawings of outerplanar graphs
• Graphs with small book thickness
• Line graph operation and small worlds
• Drawing graphs within restricted area

Cites work

• A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
• A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
• An introduction to temporal graphs: an algorithmic perspective
• Drawing trees in a streaming model
• Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs
• Graph Drawing
• How to draw a planar graph on a grid
• Incremental convex planarity testing
• Offline drawing of dynamic trees: algorithmics and document integration
• On simultaneous planar graph embeddings
• On-Line Planarity Testing
• Picking planar edges; or, drawing a graph with a planar subgraph
• Streamed Graph Drawing and the File Maintenance Problem

Cited in

(8)

• Drawing trees in a streaming model
• A Tipping Point for the Planarity of Small and Medium Sized Graphs
• Small Point-Sets Supporting Graph Stories
• Small point-sets supporting graph stories
• Drawing dynamic graphs without timeslices
• On the complexity of the storyplan problem
• On the complexity of the storyplan problem
• Graph stories in small area

This page was built for publication: Graph Stories in Small Area

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119379)