An improved bound on the one-sided minimum crossing number in two-layered drawings

Discrete and Computational Geometry

Volumn 33, Issue 4, 2005, Pages 565-591

  Nagamochi, Hiroshi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17444408938     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-005-1168-0     Document Type: Article

References (16)

1. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing: Algorithms for Visualization of Graphs, Prentice-Hall, Englewood Cliffs, NJ, 1999.
2. V. Dujmović, H. Feraau and M. Kaufmann, Fixed parameter algorithms for one-sided crossing minimization revisited, in Graph Drawing 2003, pp. 332-344, Lecture Notes in Computer Science, Vol. 2912, Springer-Verlag, Berlin, 2004.
3. V. Dujmović and S. Whitesides, An efficient fixed parameter tractable algorithm for 1-sided crossing minimization, in Graph Drawing 2002, pp. 118-129, Lecture Notes in Computer Science, Vol. 2528, Springer-Verlag, Berlin, 2002.
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 Methods 4 (1983), 312-316.
6. F. Harary and A. J. Schwenk, Trees with Hamiltonian square, Mathematika 18 (1971), 138-140.
7. F. Harary and A. J. Schwenk, A new crossing number for bipartite graphs, Util. 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 Appl. 1 (1997), 1-25.
9. X. Y- Li and M. F. Sallmann, 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 and I. Vrt'o, One-sided crossing minimization is NP-hard for sparse graphs, in Graph Drawing 2001, pp. 115-123, Lecture Notes in Computer Science, Vol. 2265, Springer-Verlag, Berlin, 2002.
12. H. Nagamochi, On the one-sided crossing minimization in a bipartite graph with large degrees, Theoret. Comput. Sci. 332 (2005), 417-446.
13. H. Nagamochi and N. Yamada, Counting edge crossings in a 2-layered drawing, Inform. Process. Lett. 91 (2004), 221-225.
14. C. Sechen, VLSI Placement and Global Routing Using Simulated Annealing, Kluwer, Dordrecht, 1988.
15. K. Sugiyama, S. Tagawa and M. Toda, Methods for visual understanding of hierarchical system structures, IEEE Trans. Systems Man Cybernet. 11 (1981), 109-125.
16. A. Yamaguchi and A. Sugimoto, An approximation algorithm for the two-layered graph drawing problem, in Proc. COCOON99, pp. 81-91, Lecture Notes in Computer Science, Vol. 1627, Springer-Verlag, Berlin, 1999.