Crossing minimization problems of drawing bipartite graphs in two clusters

Conferences in Research and Practice in Information Technology Series

Volumn 45, Issue , 2005, Pages 33-37

  Zheng, Lanbo ^a   Song, Le ^a   Eades, Peter ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BI-LAYER; BIPARTITE GRAPHS; CROSSING MINIMIZATION; GRAPH DRAWING; NP COMPLETE;

DRAWING (GRAPHICS); VISUALIZATION;

GRAPH THEORY;

EID: 84883576898     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. J. Pach and G. Toth. (2000), Which crossing number is it anyway, J. Combin. Theory Ser. B, 80, 225-246.
2. G. D. Battista, P. Eades, R. Tamassia, and I. G. Tollis. (1999), Graph Drawing Algorithms for the Visualization of Graphs, Prentice Hall.
3. P. Eades, K. Sugiyama. (1990), How to draw a directed graph, Journal of Information Processing, 13(4), 424-437.
4. P. Eades and N. C.Wormald. (1994), Edge crossing in drawing bipartite graphs, Algorithmica, 11, 379- 403.
5. M. R. Gary and D. S. Johnson. (1983), Crossing number is NP-complete, SIAM J. Algeraic and Discrete Methods, 4, 312-316.
6. K. Sugiyama, S. Tagawa, M. Toda. (1981), Methods for Visual Understanding of Hierarchical System Structures, IEEE Transactions on Systems, Man, and Cybernetics, SMC-11, 109-125.
7. H. Nagamochi. (2003), An Improved Approximation to the One-sided Bilayer Drawing, in Proceedings of the 11th International Symposium on Graph Drawing (GD '03), Lecture Notes in Computer Science, 2912, 406-418, Springer.
8. T. Biedl, M. Kaufmann and P. Mutzel. (1998), Drawing Planar Partitions II HH-Drawings, Technical Report RRR 11- 98, RUTCOR, Rutgers University.
9. U. Föbmeier and M. Kaufmann. (1997), Nice Drawings for Planar Bipartite Graphs, Proceedings of the 3th Italian Conference on Algorithms and Complexity, March 12-14, 122-134.
10. M. R. Garey, D. S. Johnson and L. J. Stockmeyer. (1976), Some simplified NP-complete graph problems, Journal of Theoretical Computer Science, 1, 237-267.
11. H. Nagamochi, (2004), by private comunication.