Arboricity and subgraph listing algorithms
SIAM Journal on Computing
Edge concentration: a method for clustering directed graphs
SCM '89 Proceedings of the 2nd International Workshop on Software configuration management
Arboricity and bipartite subgraph listing algorithms
Information Processing Letters
An experimental comparison of three graph drawing algorithms (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
An open graph visualization system and its applications to software engineering
Software—Practice & Experience - Special issue on discrete algorithm engineering
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Grappa: A GRAPh PAckage in Java
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Consensus algorithms for the generation of all maximal bicliques
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
GD'05 Proceedings of the 13th international conference on Graph Drawing
GD'04 Proceedings of the 12th international conference on Graph Drawing
Train tracks and confluent drawings
GD'04 Proceedings of the 12th international conference on Graph Drawing
Confluent drawing algorithms using rectangular dualization
GD'10 Proceedings of the 18th international conference on Graph drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
Planar and poly-arc lombardi drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
Force-Directed lombardi-style graph drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
| Hi-index | 0.00 |
Confluent drawing is a technique that allows some non-planar graphs to be visualized in a planar way. This approach merges edges together, drawing groups of them as single tracks, similar to train tracks. In the general case, producing confluent drawings automatically has proven quite difficult. We introduce the biclique edge cover graph that represents a graph G as an interconnected set of cliques and bicliques. We do this in such a way as to permit a straightforward transformation to a confluent drawing of G. Our result is a new sufficient condition for confluent planarity and an additional algorithmic approach for generating confluent drawings. We give some experimental results gauging the performance of existing confluent drawing heuristics.