Crossing minimization problems of drawing bipartite graphs in two clusters

Authors:
Lanbo Zheng;Le Song;Peter Eades
Affiliations:
University of Sydney, Australia;University of Sydney, Australia;University of Sydney, Australia
Venue:
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Year:
2005

Citing 4
Cited 5

How to draw a directed graph

Journal of Information Processing
Which crossing number is it anyway?

Journal of Combinatorial Theory Series B
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Nice Drawings for Planar Bipartite Graphs

CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity

Visual Analysis Tool for Bipartite Networks

KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Anchored Map: Graph Drawing Technique to Support Network Mining

IEICE - Transactions on Information and Systems
Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D

Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques
A solution to bipartite drawing problem using genetic algorithm

ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
Optimizing a radial layout of bipartite graphs for a tool visualizing security alerts

GD'11 Proceedings of the 19th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The crossing minimization problem is a classic and very important problem in graph drawing (Pach, Tòth 1997); the results directly affect the effectiveness of the layout, especially for very large scale graphs. But in many cases crossings cannot be avoided. In this paper we present two models for bipartite graph drawing, aiming to reduce crossings that cannot be avoided in the traditional bilayer drawings. We characterize crossing minimization problems in these models, and prove that they are NP-complete.