Efficient Extraction of Multiple Kuratowski Subdivisions

  • Markus Chimani
  • Petra Mutzel
  • Jens M. Schmidt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4875)

Abstract

A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testing algorithms allow to extract a single such witness in linear time. We present the first linear time algorithm which is able to extract multiple Kuratowski subdivisions at once. This is of particular interest for, e.g., Branch-and-Cut algorithms which require multiple such subdivisions to generate cut constraints. The algorithm is not only described theoretically, but we also present an experimental study of its implementation.

References

  1. 1.
    OGDF - Open Graph Drawing Framework. University of Dortmund, Chair of Algorithm Engineering, Website under Construction (2007)Google Scholar
  2. 2.
    Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl. 7(5-6), 303–325 (1997)MATHGoogle Scholar
  3. 3.
    Boyer, J.M., Cortese, P.F., Patrignani, M., Di Battista, G.: Stop minding your P’s and Q’s: Implementing a fast and simple DFS-based planarity testing and embedding algorithm. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 25–36. Springer, Heidelberg (2004)Google Scholar
  4. 4.
    Boyer, J.M., Myrvold, W.J.: Stop minding your P’s and Q’s: A simplified O(n) planar embedding algorithm. In: Proc. SODA 1999, pp. 140–146. SIAM, Philadelphia, PA (1999)Google Scholar
  5. 5.
    Boyer, J.M., Myrvold, W.J.: On the cutting edge: Simplified O(n) planarity by edge addition. Journal of Graph Algorithms an Applications 8(3), 241–273 (2004)MATHMathSciNetGoogle Scholar
  6. 6.
    Buchheim, C., Chimani, M., Ebner, D., Gutwenger, C., Jünger, M., Klau, G.W., Mutzel, P., Weiskircher, R.: A branch-and-cut approach to the crossing number problem. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 37–48. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Chimani, M., Mutzel, P., Schmidt, J.M.: Efficient extraction of multiple Kuratowski subdivisions (TR). Technical Report TR07-1-002, Chair for Algorithm Engineering, Dep. of CS, University Dortmund (2007), http://ls11-www.cs.uni-dortmund.de/people/chimani/
  8. 8.
    Eppstein, D., Italiano, G.F., Tamassia, R., Tarjan, R.E., Westbrook, J.R., Yung, M.: Maintenance of a minimum spanning forest in a dynamic planar graph. J. Algorithms 13(1), 33–54 (1992)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    de Fraysseix, H., de Mendez, P.O.: On cotree-critical and DFS cotree-critical graphs. Journal of Graph Algorithms an Applications 7(4), 411–427 (2003)MATHGoogle Scholar
  10. 10.
    de Fraysseix, H., Rosenstiehl, P.: A characterization of planar graphs by Trémaux orders. Combinatorica 5(2), 127–135 (1985)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21(4), 549–568 (1974)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Jünger, M., Mutzel, P.: Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica 16(1), 33–59 (1996)MATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    Kuratowski, K.: Sur le problème des corbes gauches en topologie. Fundamenta Mathematicæ 15, 271–283 (1930)MATHGoogle Scholar
  14. 14.
    Schmidt, J.M.: Effiziente Extraktion von Kuratowski-Teilgraphen. Diploma thesis, Department of Computer Science, University of Dortmund (March 2007)Google Scholar
  15. 15.
    Williamson, S.G.: Depth-first search and Kuratowski subgraphs. J. ACM 31(4), 681–693 (1984)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Markus Chimani
    • 1
  • Petra Mutzel
    • 1
  • Jens M. Schmidt
    • 1
  1. 1.Department of Computer ScienceUniversity of DortmundGermany

Personalised recommendations