Confluent Layered Drawings

Authors:
David Eppstein;Michael T. Goodrich;Jeremy Yu Meng
Affiliations:
School of Information and Computer Science, University of California, Irvine, Irvine, CA 92697, USA;School of Information and Computer Science, University of California, Irvine, Irvine, CA 92697, USA;School of Information and Computer Science, University of California, Irvine, Irvine, CA 92697, USA
Venue:
Algorithmica
Year:
2007

Citing 0
Cited 5

Confluent drawing algorithms using rectangular dualization

GD'10 Proceedings of the 18th international conference on Graph drawing
Confluent hasse diagrams

GD'11 Proceedings of the 19th international conference on Graph Drawing
Overloaded orthogonal drawings

GD'11 Proceedings of the 19th international conference on Graph Drawing
Planar and poly-arc lombardi drawings

GD'11 Proceedings of the 19th international conference on Graph Drawing
Force-Directed lombardi-style graph drawing

GD'11 Proceedings of the 19th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

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.