A Linear Edge Kernel for Two-Layer Crossing Minimization

  • Yasuaki Kobayashi
  • Hirokazu Maruta
  • Yusuke Nakae
  • Hisao Tamaki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7936)

Abstract

We consider a simple generalization of two-layer crossing minimization problem (TLCM) called leaf-edge-weighted TLCM (LEW-TLCM), where we allow positive weights on edges incident to leaves, and show that this problem admits a kernel with O(k) edges provided that the given graph is connected. As a straightforward consequence, LEW-TLCM (and hence TLCM) has a fixed parameter algorithm that runs in 2O(k logk) + nO(1) time which improves on the previously best known algorithm with running time \(2^{O(k^3)}n\).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25(6), 1305–1317 (1996)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms 21(2), 358–402 (1996)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Chimani, M., Hungerländer, P., Jünger, M., Mutzel, P.: An SDP approach to multi-level crossing minimization. Journal of Experimental Algorithmics 3(3), 1–16 (2012)Google Scholar
  4. 4.
    Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer (1999)Google Scholar
  5. 5.
    Dujmović, V., Fellows, M.R., Hallet, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Whitesides, S., Wood, D.R.: A fixed parameter approach to two-layer planarization. Algorithmica 45(2), 159–182 (2006)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Dujmović, V., Fellows, M.R., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Suderman, M., Whitesides, S., Wood, D.R.: On the parameterized complexity of layered graph drawing. Algorithmica 52(2), 267–292 (2008)MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Dujmović, V., Fernau, H., Kaufmann, M.: Fixed parameter algorithms for one-sided crossing minimization revisited. Journal of Discrete Algorithms 6(2), 313–323 (2008)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Dujmović, V., Whitesides, S.: An efficient fixed parameter tractable algorithm for 1-sided crossing minimization. Algorithmica 40(1), 15–31 (2004)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Eades, P., McKay, B.D., Wormald, N.C.: On an edge crossing problem. In: Proceedings of 9th Australian Computer Science Conference, pp. 327–334 (1986)Google Scholar
  10. 10.
    Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11(4), 379–403 (1994)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Fernau, H., Fomin, F.V., Lokshtanov, D., Mnich, M., Philip, G., Saurabh, S.: Ranking and drawing in subexponential time. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol. 6460, pp. 337–348. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  12. 12.
    Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM. J. on Algebraic and Discrete Methods 4(3), 312–316 (1982)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Kobayashi, Y., Tamaki, H.: A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 683–694. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  14. 14.
    Shahrokhi, F., Sýkora, O., Székely, L.A., Vrt’o, I.: On bipartite Drawings and the linear arrangement problem. SIAM Journal on Computing 30(6), 1773–1789 (2001)MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Spinrad, J., Brandstädt, A., Stewart, L.: Bipartite permutation graphs. Discrete Applied Mathematics 18(3), 279–292 (1987)MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    Suderman, M.: Layered graph drawing. PhD thesis, School of Computer Science, McGill University Montréal (2005)Google Scholar
  17. 17.
    Zheng, L., Buchheim, C.: A new exact algorithm for the two-sided crossing minimization problem. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, pp. 301–310. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Yasuaki Kobayashi
    • 1
  • Hirokazu Maruta
    • 1
  • Yusuke Nakae
    • 1
  • Hisao Tamaki
    • 1
  1. 1.Meiji UniversityKawasakiJapan

Personalised recommendations