Applying Crossing Reduction Strategies to Layered Compound Graphs

Authors:
Michael Forster
Affiliations:
-
Venue:
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Year:
2002

Citing 3
Cited 5

Graph layout for applications in compiler construction

Theoretical Computer Science
Drawing clusters and hierarchies

Drawing graphs
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization

GD '95 Proceedings of the Symposium on Graph Drawing

Automatic layout of UML use case diagrams

Proceedings of the 4th ACM symposium on Software visualization
Crossing minimization in weighted bipartite graphs

Journal of Discrete Algorithms
Crossing minimization in weighted bipartite graphs

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Confluent layered drawings

GD'04 Proceedings of the 12th international conference on Graph Drawing
A fast and simple heuristic for constrained two-level crossing reduction

GD'04 Proceedings of the 12th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new method for the application of 2-layer crossing reduction algorithms to layered compound graphs. It is based on an algorithm by Sander [9, 7, 8] and improves it with fewer crossings. Our method is optimal in the sense that it does not introduce unnecessary crossings by itself. If used with an optimal 2-layer crossing reduction algorithm, the crossing reduction for 2-layer compound graphs is optimal, too.