Conferences in Research and Practice in Information Technology
  

Online Version - Last Updated - 20 Jan 2012

 

 
Home
 

 
Procedures and Resources for Authors

 
Information and Resources for Volume Editors
 

 
Orders and Subscriptions
 

 
Published Articles

 
Upcoming Volumes
 

 
Contact Us
 

 
Useful External Links
 

 
CRPIT Site Search
 
    

Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters

Zheng, L., Song, L. and Eades, P.

    The crossing minimization problem is a classic and very important problem in graph drawing (Pach, T'oth 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.
Cite as: Zheng, L., Song, L. and Eades, P. (2005). Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters. In Proc. Asia Pacific Symposium on Information Visualisation (APVIS2005), Sydney, Australia. CRPIT, 45. Hong, S.-H., Ed. ACS. 33-37.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS
 

 

ACS Logo© Copyright Australian Computer Society Inc. 2001-2014.
Comments should be sent to the webmaster at crpit@scem.uws.edu.au.
This page last updated 16 Nov 2007