A Fast Layout Algorithm for k-Level Graphs
Christoph Buchheim, Michael Jünger, Sebastian Leipert · Lecture notes in computer science · 2001
Cited by 30 works. doi:10.1007/3-540-44541-2_22
Authors
References
- Methods for Visual Understanding of Hierarchical System Structures
- A technique for drawing directed graphs
- Crossing Number is NP-Complete
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- A fast heuristic for hierarchical Manhattan layout
- AGD: A Library of Algorithms for Graph Drawing
- A Library of Algorithms for Graph Drawing
- Algorithmen zum automatischen Zeichnen von Graphen