Configurations with Few Crossings in Topological Graphs

  • Christian Knauer
  • Étienne Schramm
  • Andreas Spillner
  • Alexander Wolff
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3827)

Abstract

In this paper we study the problem of computing subgraphs of a certain configuration in a given topological graph G such that the number of crossings in the subgraph is minimum. The configurations that we consider are spanning trees, st paths, cycles, matchings, and κ-factors for κ ∈ {1,2}. We show that it is NP-hard to approximate the minimum number of crossings for these configurations within a factor of k1 − ε for any ε > 0, where k is the number of crossings in G. We then show that the problems are fixed-parameter tractable if we use the number of crossings in the given graph as the parameter. Finally we present a simple but effective heuristic for spanning trees.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
  2. 2.
    Halperin, D.: Arrangements. In: Handbook of Discrete and Computational Geometry, ch. 24, pp. 529–562. CRC Press, Boca Raton (2004)Google Scholar
  3. 3.
    Jansen, K., Woeginger, G.J.: The complexity of detecting crossingfree configurations in the plane. BIT 33, 580–595 (1993)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Knauer, C., Schramm, É., Spillner, A., Wolff, A.: Configurations with few crossings in topological graphs. Techical Report 2005-24, Universität Karlsruhe (September 2005), http://www.ubka.uni-karlsruhe.de/cgi-bin/psview?document=/ira/2005/24
  5. 5.
    Kratochvíl, J., Lubiw, A., Nešetřil, J.: Noncrossing subgraphs in topological layouts. SIAM J. Disc. Math. 4(2), 223–244 (1991)MATHCrossRefGoogle Scholar
  6. 6.
    Micali, S., Vazirani, V.V.: An \( {O} (\sqrt{|V|} |{E}|)\) algorithm for finding maximum matching in general graphs. In: Proc. IEEE Symp. Found. Comp. Sci., pp. 17–27 (1980)Google Scholar
  7. 7.
    Rendl, F., Woeginger, G.: Reconstructing sets of orthogonal line segments in the plane. Discrete Mathematics 119, 167–174 (1993)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Tutte, W.T.: A short proof of the factor theorem for finite graphs. Canad. J. Math. 6, 347–352 (1954)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Vazirani, V.V.: A theory of alternating paths and blossoms for proving correctness of the O (| V |1/2 | E |) general graph matching algorithm. Combinatorica 14, 71–91 (1994)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Christian Knauer
    • 1
  • Étienne Schramm
    • 2
  • Andreas Spillner
    • 3
  • Alexander Wolff
    • 2
  1. 1.Institute of Computer ScienceFreie Universität Berlin 
  2. 2.Fakultät für InformatikUniversität KarlsruheKarlsruhe
  3. 3.Institute of Computer ScienceFriedrich-Schiller-Universität Jena 

Personalised recommendations