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

Journal of Graph Algorithms and Applications

Volumn 9, Issue 1, 2005, Pages 149-163

  Suderrnan, Matthew ^a   Whitesides, Sue ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

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

INTEGER PROGRAMMING;

EID: 27744478278     PISSN: 15261719     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00103     Document Type: Conference Paper

References (17)

1. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, 1999.
2. R. G. Downey and M. R. Fellows. Parametrized Complexity. Springer-Verlag, 1999.
3. V. Dujmović, M. R. Fellows, M. T. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. A. Rosamond, M. Suderman, S. White-sides, and D. R. Wood. A fixed-parameter approach to two-layer planarization. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing, 9th International Symposium (GD 2001), volume 2265 of Lecture Notes in Computer Science, pages 1-15. Springer-Verlag, 2001.
4. V. Dujmović, M. R. Fellows, M. T. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. A. Rosamond, M. Suderman, S. White-sides, and D. R. Wood. A fixed-parameter approach to two-layer planarization. Algorithmica, to appear.
5. P. Eades, B. McKay, and N. Wormald. On an edge crossing problem. In Proceedings of the 9th Australian Computer Science Conference, pages 327-334. Australian National University, 1986.
6. M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM Journal of Algebraic Discrete Methods, 4(3):312-316, 1983.
7. F. Harary and A. Schwenk. A new crossing number for bipartite graphs. Utilitas Mathematica, 1:203-209, 1972.
8. M. Jünger and P. Mutzel. 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications, 1(1):1-25, 1997.
9. M. Jünger and S. Thienel. The ABACUS-system for branch and cut and price algorithms in integer programming and combinatorial optimization. In Software-Practice and Experience, volume 30, pages 1324-1352, 2000.
10. M. Kaufmann and D. Wagner. Drawing Graphs: Methods and Models, volume 2025 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
11. D. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, Addison-Wesley Publishing Company, 1993.
12. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Wiley, 1990.
13. P. Mutzel. An alternative method to crossing minimization on hierarchical graphs. In S. C. North, editor, Graph Drawing, Symposium on Graph Drawing (GD '96), volume 1190 of Lecture Notes in Computer Science, pages 318-333. Springer-Verlag, 1996.
14. P. Mutzel. An alternative method to crossing minimization on hierarchical graphs. SIAM Journal of Optimization, 11 (4): 1065-1080, 2001.
15. P. Mutzel. Optimization in leveled graphs. In P. M. Pardalos and C. A. Floudas, editors, Encyclopedia of Optimization, pages 189-196. Kluwer Academic Publishers, 2001.
16. N. Tomii, Y. Kambayashi, and S. Yajima. On planarization algorithms of 2-level graphs. Technical Report EC77-38, Institute of Electronic and Communication Engineers of Japan (IECEJ), 1977.
17. M. S. Waterman and J. R. Griggs. Interval graphs and maps of DNA. Bulletin of Mathematical Biology, 48(2):189-195, 1986.