Cyclic Leveling of Directed Graphs

DOI10.1007/978-3-642-00219-9_34MaRDI QIDQ3611870zbMATH OpenOpenAlexFDO

Authors Christian Bachmaier, Wolfgang Brunner, Gergö Lovász, Franz J. Brandenburg

Publication date 3 March 2009

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00219-9_34

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Coordinate Assignment for Cyclic Level Graphs
• Drawing recurrent hierarchies
• Cyclic Level Planarity Testing and Embedding
• Global k-level crossing reduction
• Algorithms and bounds for drawing directed graphs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Drawing graphs. Methods and models
• Introduction to algorithms
• Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
• Optimal scheduling for two-processor systems

Cited in

(9)

• Coordinate Assignment for Cyclic Level Graphs
• Algorithms and bounds for drawing directed graphs
• A new framework for hierarchical drawings
• Topological Decomposition of Directed Graphs
• Drawing recurrent hierarchies
• scientific article; zbMATH DE number 139900 (Why is no real title available?)
• Computing hive plots: a combinatorial framework
• Computing hive plots: a combinatorial framework
• Global k-level crossing reduction

This page was built for publication: Cyclic Leveling of Directed Graphs

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