How to layer a directed acyclic graph

DOI10.1007/3-540-45848-4_2MaRDI QIDQ3043701zbMATH OpenFDO

Authors Patrick Healy, Nikola S. Nikolov

Publication date 6 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2265/22650016.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Facets of the directed acyclic graph layering polytope
• A generalization of the directed graph layering problem
• A branch-and-cut approach to the directed acyclic graph layering problem
• Generalized layerings for arbitrary and fixed drawing areas
• Compact layered drawings of general directed graphs

Cited in

(14)

• Variable neighborhood scatter search for the incremental graph drawing problem
• Track layouts, layered path decompositions, and leveled planarity
• Graph layering by promotion of nodes
• Linear layout of directed grid graph
• Column-based graph layouts
• A generalization of the directed graph layering problem
• Compact layered drawings of general directed graphs
• Track layout is hard
• Facets of the directed acyclic graph layering polytope
• A branch-and-cut approach to the directed acyclic graph layering problem
• Column-based graph layouts
• Multilevel algorithms for acyclic partitioning of directed acyclic graphs
• Generalized layerings for arbitrary and fixed drawing areas
• Graph Drawing

This page was built for publication: How to layer a directed acyclic graph

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