Fixed parameter algorithms for one-sided crossing minimization revisited

Journal of Discrete Algorithms

Volumn 6, Issue 2, 2008, Pages 313-323

  Dujmović, Vida ^a   Fernau, Henning ^b   Kaufmann, Michael ^c  

^a MCGILL UNIVERSITY   (Canada)

^b UNIVERSITY OF TRIER   (Germany)

^c UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

2 layer drawings; Crossing minimization; FPT; Graph drawing; Parameterized algorithms

Indexed keywords

OPTIMIZATION; PARAMETER ESTIMATION; PARAMETERIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

2 LAYER DRAWINGS; CROSSING MINIMIZATION; GRAPH DRAWING; PARAMETERIZED ALGORITHMS;

LEARNING ALGORITHMS;

EID: 42249109537     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2006.12.008     Document Type: Article

References (12)

1. Abu-Khzam F., and Fernau H. Kernels: annotated, proper and induced. In: Bodlaender H.L., and Langston M. (Eds). International Workshop on Parameterized and Exact Computation IWPEC. Lecture Notes Comput. Sci. vol. 4169 (2006), Springer 264-275
2. Di Battista G., Eades P., Tamassia R., and Tollis I.G. Graph Drawing: Algorithms for the Visualization of Graphs (1999), Prentice-Hall
3. Downey R., and Fellows M. Parameterized Complexity (1999), Springer
4. Dujmović V., Fellows M., Hallet M., Kitching M., Liotta G., McCartin C., Nishimura N., Ragde P., Rosamond F., Suderman M., Whitesides S., and Wood D. A fixed-parameter approach to 2-layer planarization. Algorithmica 45 (2006) 159-182
5. Dujmović V., Fellows M., Hallet M., Kitching M., Liotta G., McCartin C., Nishimura N., Ragde P., Rosamond F., Suderman M., Whitesides S., and Wood D. On the parameterized complexity of layered graph drawing. Proc. European Symposium on Algorithms (ESA'01). Lecture Notes Comput. Sci. vol. 2161 (2001), Springer 488-499
6. Dujmović V., Fernau H., and Kaufmann M. Fixed parameter algorithms for one-sided crossing minimization revisited. Proc. of International Symposium on Graph Drawing (GD '03). Lecture Notes Comput. Sci. vol. 2912 (2004), Springer 332-344
7. Dujmović V., and Whitesides S. An efficient fixed parameter tractable algorithm for 1-sided crossing minimization. Algorithmica 40 (2004) 15-31
8. Eades P., and Wormald N.C. Edge crossings in drawings of bipartite graphs. Algorithmica 11 (1994) 379-403
9. Muñoz X., Unger W., and Vrt'o I. One sided crossing minimization is NP-hard for sparse graphs. Proc. of International Symposium on Graph Drawing (GD'01). Lecture Notes Comput. Sci. vol. 2265 (2006), Springer 115-123
10. Nagamochi H. An improved bound on the one-sided minimum crossing number in two-layered drawings. Discrete and Computational Geometry 33 (2005) 569-591
11. Niedermeier R., and Rossmanith P. A general method to speed up fixed-parameter-tractable algorithms. Information Processing Letters 73 (2000) 125-129
12. Sugiyama K., Tagawa S., and Toda M. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics 11 (1981) 109-125