Confluent Layered Drawings
计算几何
2007-06-14 v1 数据结构与算法
摘要
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.
引用
@article{arxiv.cs/0507051,
title = {Confluent Layered Drawings},
author = {David Eppstein and Michael T. Goodrich and Jeremy Yu Meng},
journal= {arXiv preprint arXiv:cs/0507051},
year = {2007}
}
备注
11 pages, 6 figures. A preliminary version of this paper appeared in Proc. 12th Int. Symp. Graph Drawing, New York, 2004, Lecture Notes in Comp. Sci. 3383, 2004, pp. 184-194