An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing

DOI10.7155/JGAA.00111MaRDI QIDQ5301374zbMATH OpenOpenAlexFDO

Authors Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann

Publication date 19 January 2009

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license File:Creative commons license with attribution.png Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/55422, http://www.emis.de/journals/JGAA/accepted/2005/EiglspergerSiebenhallerKaufmann2005.9.3.pdf

Mathematics Subject Classification ID

Theory of software (68N99) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10) Nonnumerical algorithms (68W05)

Recommendations

• Graph Drawing
• On the parameterized complexity of layered graph drawing
• Deriving a class of layer-oriented graph algorithms
• Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
• Graph Drawing
• scientific article; zbMATH DE number 2080097
• Compact layered drawings of general directed graphs
• Graph Drawing
• A Multilevel Algorithm for Force-Directed Graph-Drawing
• Area-efficient static and incremental graph drawings

Cited in

(4)

• Root demotion: efficient post-processing of layered graphs to reduce dummy vertices for hierarchical graph drawing
• Graph Drawing
• Graph Drawing
• ILIGRA: an efficient inverse line graph algorithm

This page was built for publication: An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing

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