Complexity analysis of balloon drawing for rooted trees

DOI10.1016/J.TCS.2010.10.015MaRDI QIDQ620957zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Chun-Cheng Lin, Hsu-Chun Yen, Sheung-Hung Poon, 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)

Recommendations

• On Balloon Drawings of Rooted Trees
• Graph Drawing
• Pinning balloons with perfect angles and optimal area
• Pinning balloons with perfect angles and optimal area
• Drawing Trees with Perfect Angular Resolution and Polynomial Area

Cites work

• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 812077 (Why is no real title available?)
• An approximation algorithm for a bottleneck traveling salesman problem
• Complexity analysis of balloon drawing for rooted trees
• Drawing graphs. Methods and models
• On Balloon Drawings of Rooted Trees
• On Gilmore-Gomory's open question for the bottleneck TSP.
• On the Angular Resolution of Planar Graphs
• Workforce Planning in Mixed Model Assembly Systems

Cited in

(4)

• On Balloon Drawings of Rooted Trees
• Complexity analysis of balloon drawing for rooted trees
• Graph Drawing
• Pinning balloons with perfect angles and optimal area

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

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