Offline Drawing of Dynamic Trees: Algorithmics and Document Integration

DOI10.1007/978-3-319-50106-2_44zbMath1478.68260arXiv1608.08385OpenAlexW2962789738MaRDI QIDQ2961550

Till Tantau, Malte Skambath

Publication date: 21 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (8)

On the complexity of the storyplan problem ⋮ On the complexity of the storyplan problem ⋮ Small Point-Sets Supporting Graph Stories ⋮ Offline Drawing of Dynamic Trees: Algorithmics and Document Integration ⋮ Small point-sets supporting graph stories ⋮ Visualizing evolving trees ⋮ Graph Stories in Small Area ⋮ Graph stories in small area

Uses Software

• Graphviz
• SMIL
• OGDF
• TikZ
• Lua
• Dynagraph
• Nevada

Cites Work

• Optimum binary search trees
• Graph Drawing in TikZ
• Offline Drawing of Dynamic Trees: Algorithmics and Document Integration
• Tidy Drawings of Trees
• Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
• Graph Drawing
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Offline Drawing of Dynamic Trees: Algorithmics and Document Integration