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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Eppstein, D., Goodrich, M. & Meng, J. Confluent Layered Drawings. Algorithmica 47, 439–452 (2007). https://doi.org/10.1007/s00453-006-0159-8
Issue Date:
DOI: https://doi.org/10.1007/s00453-006-0159-8