Stress Majorization with Orthogonal Ordering Constraints

The adoption of the stress-majorization method from multi-dimensio- nal 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.