An efficient implementation of Sugiyama's algorithm for layered graph drawing

DOI10.1007/978-3-540-31843-9_17MaRDI QIDQ5711600zbMATH OpenOpenAlexFDO

Authors Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann

Publication date 7 December 2005

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

Full work available at URL https://doi.org/10.1007/b105810

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

• An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing
• Root demotion: efficient post-processing of layered graphs to reduce dummy vertices for hierarchical graph drawing
• Drawing large graphs with a potential-field-based multilevel algorithm
• Algorithms and bounds for drawing directed graphs
• Some modifications of Sugiyama approach

Cited in

(7)

• A new framework for hierarchical drawings
• An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing
• Root demotion: efficient post-processing of layered graphs to reduce dummy vertices for hierarchical graph drawing
• Drawing Graphs with GLEE
• 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 Q5711600)