Stress majorization with orthogonal ordering constraints. (English) Zbl 1171.68608
Healy, Patrick (ed.) et al., Graph drawing. 13th international symposium, GD 2005, Limerick, Ireland, September 12–14, 2005. Revised papers. Berlin: Springer (ISBN 3-540-31425-3/pbk). Lecture Notes in Computer Science 3843, 141-152 (2006).
Summary: The adoption of the stress-majorization method from multi-dimensional scaling into graph layout has provided an improved mathematical basis and better convergence properties for so-called “force-directed placement” techniques. In this paper we give an algorithm for augmenting such stress-majorization techniques with orthogonal ordering constraints and we demonstrate several graph-drawing applications where this class of constraints can be very useful.
For the entire collection see [Zbl 1097.68006].
For the entire collection see [Zbl 1097.68006].
MSC:
| 68R10 | Graph theory (including graph drawing) in computer science |
| 05C62 | Graph representations (geometric and intersection representations, etc.) |
| 05C85 | Graph algorithms (graph-theoretic aspects) |
| 90C35 | Programming involving graphs or networks |
