Switch-regular upward planar embeddings of trees

DOI10.1007/978-3-642-11440-3_6MaRDI QIDQ3404429zbMATH OpenOpenAlexFDO

Authors Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin

Publication date 9 February 2010

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11440-3_6

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Switch-regular upward planarity testing of directed trees
• Upward Planar Drawings and Switch-regularity Heuristics
• SOFSEM 2005: Theory and Practice of Computer Science
• Upward Point-Set Embeddability
• Upward planarity testing

Cited in

(2)

• SOFSEM 2005: Theory and Practice of Computer Science
• Switch-regular upward planarity testing of directed trees

This page was built for publication: Switch-regular upward planar embeddings of trees

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