Switch-regular upward planarity testing of directed trees

DOI10.7155/JGAA.00241MaRDI QIDQ2865045zbMATH OpenOpenAlexFDO

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

Publication date 28 November 2013

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://doi.org/10.7155/jgaa.00241

zbMATH Keywords

switch-regular drawingupward planarity testing problem

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

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

Cited in

(5)

• Upward and quasi-upward planarity testing of embedded mixed graphs
• Switch-regular upward planar embeddings of trees
• On Turn-Regular Orthogonal Representations
• On turn-regular orthogonal representations
• SOFSEM 2005: Theory and Practice of Computer Science

This page was built for publication: Switch-regular upward planarity testing of directed trees

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