Confluent Layered Drawings

Details Confluent Layered Drawings Confluent Layered Drawings

2005-07-19

arxiv.org/abs/cs/0507051v1

Algorithmica 47(4):439-452, 2007

Computer Science

Computational Geometry

11 pages, 6 figures. A preliminary version of this paper appeared in Proc. 12th Int. Symp. Graph Drawing, New York, 2004, Lect

Scientific paper

10.1007/s00453-006-0159-8

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.

Affiliated with

Also associated with

No associations

Rating

Confluent Layered Drawings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Confluent Layered Drawings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Confluent Layered Drawings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-491181