Drawing recurrent hierarchies

DOI10.7155/JGAA.00254MaRDI QIDQ3143735zbMATH OpenOpenAlexFDO

Authors Christian Bachmaier, Wolfgang Brunner, Raymund Fülöp, Franz J. Brandenburg

Publication date 4 December 2012

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.00254

zbMATH Keywords

cyclic dependencieshierarchical drawings

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Coordinate Assignment for Cyclic Level Graphs
• Cyclic Leveling of Directed Graphs
• Cyclic Level Planarity Testing and Embedding
• Algorithms and bounds for drawing directed graphs
• Drawing directed graphs clockwise

Cited in

(9)

• Crossing-constrained hierarchical drawings
• Upward planar graphs and their duals
• Topological Decomposition of Directed Graphs
• Drawing directed graphs clockwise
• Cyclic Leveling of Directed Graphs
• Upward planar drawings on the standing and the rolling cylinders
• scientific article; zbMATH DE number 1974120 (Why is no real title available?)
• A new framework for hierarchical drawings
• Coordinate Assignment for Cyclic Level Graphs

This page was built for publication: Drawing recurrent hierarchies

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