
13
Hierarchical Drawing Algorithms
Patrick Healy
University of Limerick
Nikola S. Nikolov
University of Limerick
13.1 Introduction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 409
Current Approaches and Their Limitations
•
Overview of
Sugiyama’s Framework
13.2 Cycle Removal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 413
Heuristics Based on Vertex Orderings
•
Berger-Shor
Algorithm
•
Greedy Cycle Removal
•
Heuristics Based on
Cycle Breaking
•
Minimum FAS in a Weighted Digraph
•
Other Approaches
13.3 Layer Assignment . . . . . . . . . . . . . . . . . . . . . . . . . .