Experiments with the fixed-parameter approach for two-layer planarization

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

Volumn 2912, Issue , 2004, Pages 345-356

  Suderman, Matthew ^a   Whitesides, Sue ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

COMPUTATIONAL RESULTS; FIXED-PARAMETER TRACTABILITY; INTEGER LINEAR PROGRAMMING; PLANARIZATION; RUNNING TIME; SPARSE GRAPHS; TWO-LAYER;

INTEGER PROGRAMMING;

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

References (17)

1. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)
2. Downey, R.G., Fellows, M.R.: Parametrized Complexity. Springer-Verlag (1999)
3. Dujmovic, V., Fellows, M.R., Hallett, M.T., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F.A., Suderman, M., Whitesides, S., Wood, D.R.: A fixed-parameter approach to two-layer planarization. In Mutzel, P., Jünger, M., Leipert, S., eds.: Graph Drawing, 9th International Symposium (GD 2001). Volume 2265 of Lecture Notes in Computer Science., Springer-Verlag (2001) 1-15
4. Dujmovic, V., Fellows, M.R., Hallett, M.T., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F.A., Suderman, M., Whitesides, S., Wood, D.R.: A fixed-parameter approach to two-layer planarization, manuscript (2003)
5. Eades, P., McKay, B., Wormald, N.: On an edge crossing problem. In: Proceedings of the 9th Australian Computer Science Conference, Australian National University (1986) 327-334
6. Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM Journal of Algebraic Discrete Methods 4 (1983) 312-316
7. Harary, F., Schwenk, A.: A new crossing number for bipartite graphs. Utilitas Mathematica 1 (1972) 203-209
8. Jünger, M., Mutzel, P.: 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications 1 (1997) 1-25
9. Jünger, M., Thienel, S.: The ABACUS-system for branch and cut and price algorithms in integer programming and combinatorial optimization. In: SoftwarePractice and Experience. Volume 30. (2000) 1324-1352
10. Knuth, D.: The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, Addison-Wesley Publishing Company (1993)
11. Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Wiley (1990)
12. Mutzel, P.: An alternative method to crossing minimization on hierarchical graphs. In North, S.C., ed.: Graph Drawing, Symposium on Graph Drawing (GD '96). Volume 1190 of Lecture Notes in Computer Science., Springer-Verlag (1996) 318333
13. Mutzel, P.: An alternative method to crossing minimization on hierarchical graphs. SIAM Journal of Optimization 11 (2001) 1065-1080
14. Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics 11 (1981) 109-125
15. Tomii, N., Kambayashi, Y., Yajima, S.: On planarization algorithms of 2-level graphs. Papers of tech. group on elect, comp., IECEJ EC77-38 (1977) 1-12
16. Warfield, J.N.: Crossing theory and hierarchy mapping. IEEE Transactions on Systems, Man, and Cybernetics 7 (1977) 502-523
17. Waterman, M.S., Griggs, J.R.: Interval graphs and maps of DNA. Bulletin of Mathematical Biology 48 (1986) 189-195