Arboricity and subgraph listing algorithms
SIAM Journal on Computing
On floorplans of planar graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On Triangulating Planar Graphs under the Four-Connectivity Constraint
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
Two Algorithms for Finding Rectangular Duals of Planar Graphs
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Planarity for Clustered Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Algorithmica
Train Tracks and Confluent Drawings
Algorithmica
Straight-Line Rectangular Drawings of Clustered Graphs
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Biclique edge cover graphs and confluent drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
| Hi-index | 0.00 |
The need of effective drawings for non-planar dense graphs is motivated by the wealth of applications in which they occur, including social network analysis, security visualization and web clustering engines, just to name a few. One common issue graph drawings are affected by is the visual clutter due to the high number of (possibly intersecting) edges to display. Confluent drawings address this problem by bundling groups of edges sharing the same path, resulting in a representation with less edges and no edge intersections. In this paper we describe how to create a confluent drawing of a graph from its rectangular dual and we show two important advantages of this approach.