Confluent Layered Drawings

Eppstein, David and Goodrich, Michael T. and Meng, Jeremy Yu (2004) Confluent Layered Drawings. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 184-194(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_20).

Full text not available from this repository.

Abstract

We combine the idea of confluent drawings with Sugiyama style drawings, in order to reduce the edge crossings in the resultant drawings. Furthermore, it is easier to understand the structures of graphs from the mixed style drawings. The basic idea is to cover a layered graph by complete bipartite subgraphs (bicliques), then replace bicliques with tree-like structures. The biclique cover problem is reduced to a special edge coloring problem and solved by heuristic coloring algorithms. Our method can be extended to obtain multi-depth confluent layered drawings. Work by the first author is supported by NSF grant CCR-9912338. Work by the second and the third author is supported by NSF grants CCR-0098068, CCR-0225642, and DUE-0231467.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-31843-9_20
Classifications: M Methods > M.500 Layered
P Styles > P.480 Layered
P Styles > P.300 Curved
URI: http://gdea.informatik.uni-koeln.de/id/eprint/586

Actions (login required)

View Item View Item