A fast layout algorithm for k-level graphs

DOI10.1007/3-540-44541-2_22MaRDI QIDQ4472311zbMATH OpenFDO

Authors Christoph Buchheim, Michael Jünger, Sebastian Leipert

Publication date 4 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/1984/19840229.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

• A multilevel algorithm for force-directed graph drawing
• Some modifications of Sugiyama approach
• A Multilevel Algorithm for Force-Directed Graph-Drawing
• scientific article; zbMATH DE number 2084264
• Level Planar Embedding in Linear Time

Cited in

(8)

• A flow formulation for horizontal coordinate assignment with prescribed width
• Optimal level placement of the transitive oriented and bipartite oriented graphs by height
• A generalization of the directed graph layering problem
• scientific article; zbMATH DE number 2084264 (Why is no real title available?)
• scientific article; zbMATH DE number 2069509 (Why is no real title available?)
• A flow formulation for horizontal coordinate assignment with prescribed width
• A new framework for hierarchical drawings
• On the parameterized complexity of layered graph drawing

This page was built for publication: A fast layout algorithm for \(k\)-level graphs

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