Confluent Layered Drawings

Simple item page
dc.creatorEppstein, David
dc.creatorGoodrich, Michael T.
dc.creatorMeng, Jeremy Yu
dc.date2005-07-19
dc.date.accessioned2026-07-07T08:09:28Z
dc.date.available2026-07-07T08:09:28Z
dc.descriptionWe 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.
dc.description11 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
dc.identifierhttps://arxiv.org/abs/cs/0507051
dc.identifierhttp://arxiv.org/abs/cs/0507051
dc.identifierAlgorithmica 47(4):439-452, 2007
dc.identifierdoi:10.1007/s00453-006-0159-8
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131554
dc.subjectComputational Geometry
dc.subjectData Structures and Algorithms
dc.subjectF.2.2
dc.titleConfluent Layered Drawings
dc.typetext

Files

Collections

arXiv