An improved approximation to the one-sided bilayer drawing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2912, Issue , 2004, Pages 406-418

  Nagamochi, Hiroshi ^a  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

BI-LAYER; BIPARTITE GRAPHS; CROSSING MINIMIZATION; CROSSING NUMBER; LOWER BOUNDS; NODE PAIRS; PARALLEL LINE; VERTEX SET;

GRAPH THEORY;

EID: 13644251722     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24595-7_38     Document Type: Article

References (13)

1. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing: Algorithms for Visualization of Graphs, Prentice Hall (1999).
2. V. Dujmović and S. Whitesides, An efficient fixed parameter tractable algorithm for 1-sided crossing minimization, Graph Drawing 2002, Lecture Notes in Computer Science, 2528, Springer-Verlag, Berlin (2002) 118-129.
3. P. Eades and N. C. Wormald, Edge crossing in drawing bipartite graphs, Algorithmica, 11 (1994) 379-403.
4. M. R. Garey and D. S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods, 4 (1983) 312-316.
5. F. Harary and A. J. Schwenk, Trees with Hamiltonian square, Mathematiks, 18 (1971) 138-140.
6. F. Harary and A. J. Schwenk, A new crossing number for bipartite graphs, Utilitas Math., 1 (1972) 203-209.
7. M. Jünger and P. Mutzel, 2-layer straight line crossing minimization: performance of exact and heuristic algorithms, J. Graph Algorithms and Applications, 1 (1997) 1-25.
8. X. Y- Li and M. F. Sallmann, New bounds on the barycenter heuristic for bipartite drawing, Information Processing Letters, 82 (2002) 293-298.
9. E. Mäkinen, Experiments on drawing 2-level hierarchical graphs, International Journal of Computer Mathematics, 36 (1990) 175-181.
10. X. Munoz, W. Unger and I. Vrt'o, One sided crossing minimization is NP-hard for sparse graphs, Graph Drawing 2001, Lecture Notes in Computer Science, 2265, Springer-Verlag, Berlin (2002) 115-123.
11. G. Sechen, VLSI Placement and Global Routing Using Simulated Annealing, Kluwer, Dordrecht (1988).
12. 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.
13. A. Yamaguchi and A. Sugimoto, An approximation algorithm for the two-layered graph drawing problem, In: 5th Annual Intl. Conf. on Computing and Combinatorics, Lecture Notes in Computer Science, 1627, Springer-Verlag, Berlin (1999) 81-91.