Complexity analysis of balloon drawing for rooted trees

DOI10.1016/j.tcs.2010.10.015zbMath1214.05163OpenAlexW1629365507WikidataQ62041801 ScholiaQ62041801MaRDI QIDQ620957

Sheung-Hung Poon, Chun-Cheng Lin, Hsu-Chun Yen, Jia-Hao Fan

Publication date: 2 February 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.015

zbMATH Keywords

graph algorithmsgraph drawingtree drawing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Pinning Balloons with Perfect Angles and Optimal Area ⋮ Complexity analysis of balloon drawing for rooted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity analysis of balloon drawing for rooted trees
• An approximation algorithm for a bottleneck traveling salesman problem
• On Gilmore-Gomory's open question for the bottleneck TSP.
• On the Angular Resolution of Planar Graphs
• Workforce Planning in Mixed Model Assembly Systems
• On Balloon Drawings of Rooted Trees
• Drawing graphs. Methods and models

This page was built for publication: Complexity analysis of balloon drawing for rooted trees