On the one-sided crossing minimization in a bipartite graph with large degrees

Theoretical Computer Science

Volumn 332, Issue 1-3, 2005, Pages 417-446

  Nagamochi, Hiroshi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

2 layered drawing; Approximation algorithm; Bipartite graph; Edge crossing; Graph drawing; Randomized algorithm

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; PROBLEM SOLVING; SET THEORY;

2-LAYERED DRAWING; APPROXIMATION ALGORITHMS; BIPARTITE GRAPH; EDGE CROSSING; GRAPH DRAWING; RANDOMIZED ALGORITHMS;

GRAPH THEORY;

EID: 13644261590     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.10.042     Document Type: Article

References (16)

1. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis Graph Drawing Algorithms for Visualization of Graphs 1999 Prentice-Hall Englewood Cliffs, NJ
2. V. Dujmović, H. Fernau, M. Kaufmann, Fixed parameter algorithms for one-sided crossing minimization revisited, (GD2003), Lecture Notes in Computer Science, Vol. 2912, Springer, Berlin, 2004, pp. 332-344.
3. V. Dujmović, S. Whitesides, An efficient fixed parameter tractable algorithm for 1-sided crossing minimization, (GD2002), Lecture Notes in Computer Science, Vol. 2528, Springer, Berlin, 2002, pp. 118-129.
4. P. Eades, and N.C. Wormald Edge crossing in drawing bipartite graphs Algorithmica 11 1994 379 403
5. M.R. Garey, and D.S. Johnson Crossing number is NP-complete SIAM J. Algebraic Discrete Meth. 4 1983 312 316
6. F. Harary, and A.J. Schwenk Trees with Hamiltonian square Mathematiks 18 1971 138 140
7. F. Harary, and A.J. Schwenk A new crossing number for bipartite graphs Utilitas Math. 1 1972 203 209
8. M. Jünger, and P. Mutzel 2-layer straight line crossing minimization performance of exact and heuristic algorithms J. Graph Algorithms and Appl. 1 1997 1 25
9. X. Y- Li, and M.F. Stallmann New bounds on the barycenter heuristic for bipartite drawing Inform. Process. Lett. 82 2002 293 298
10. E. Mäkinen Experiments on drawing 2-level hierarchical graphs Internat. J. Comput. Math. 36 1990 175 181
11. X. Muñoz, W. Unger, I. Vrt'o, One sided crossing minimization is NP-hard for sparse graphs, (GD2001), Lecture Notes in Computer Science, Vol. 2265, Springer, Berlin, 2002, pp. 115-123.
12. H. Nagamochi, An improved approximation to the one-sided bilayer drawing, (GD2003), Lecture Notes in Computer Science, Vol. 2912, Springer, Berlin, 2004, pp. 406-418.
13. H. Nagamochi, An improved bound on the one-sided minimum crossing number in two-layered drawings, Discrete and Computational Geometry, to appear.
14. C. Sechen VLSI Placement and Global Routing Using Simulated Annealing 1988 Kluwer Dordrecht
15. K. Sugiyama, S. Tagawa, and M. Toda Methods for visual understanding of hierarchical system structures IEEE Transactions on Systems, Man, and Cybernetics 11 1981 109 125
16. A. Yamaguchi, A. Sugimoto, An approximation algorithm for the two-layered graph drawing problem, (COCOON99), Lecture Notes in Computer Science, Vol. 1627, Springer, Berlin, 1999, pp. 81-91.