The Complexity of Several Realizability Problems for Abstract Topological Graphs

(Extended Abstract)
  • Jan Kynčl
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4875)

Abstract

An abstract topological graph (briefly an AT-graph) is a pair A = (G,R) where G = (V,E) is a graph and \(R\subseteq {E \choose 2}\) is a set of pairs of its edges. An AT-graph A is simply realizable if G can be drawn in the plane in such a way that each pair of edges from R crosses exactly once and no other pair crosses. We present a polynomial algorithm which decides whether a given complete AT-graph is simply realizable. On the other hand, we show that other similar realizability problems for (complete) AT-graphs are NP-hard.

References

  1. 1.
    Aichholzer, O., Aurenhammer, F., Krasser, H.: On the crossing number of complete graphs. Computing 76(1-2), 165–176 (2006)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. Information Processing Letters 54, 241–246 (1995)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Gassner, E., Jünger, M., Percan, M., Schaefer, M., Schulz, M.: Simultaneous graph embeddings with fixed edges. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 325–335. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Guy, R.K.: A combinatorial problem. Nabla (Bulletin of the Malayan Mathematical Society) 7, 68–72 (1960)Google Scholar
  5. 5.
    Harborth, H., Mengersen, I.: Drawings of the complete graph with maximum number of crossings. In: Proceedings of the Twenty-third Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium, Boca Raton, FL, vol. 88, pp. 225–228 (1992)Google Scholar
  6. 6.
    Kratochvíl, J., Matoušek, J.: String graphs requiring exponential representations. Journal of Combinatorial Theory Ser. B 53, 1–4 (1991)MATHCrossRefGoogle Scholar
  7. 7.
    Kratochvíl, J., Lubiw, A., Nešetřil, J.: Noncrossing subgraphs in topological layouts. SIAM Journal on Discrete Mathematics 4(2), 223–244 (1991)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Kratochvíl, J.: String graphs I: The number of critical nonstring graphs is infinite. Journal of Combinatorial Theory Ser. B 52, 53–66 (1991)MATHCrossRefGoogle Scholar
  9. 9.
    Kratochvíl, J.: String graphs II: Recognizing string graphs is NP-hard. Journal of Combinatorial Theory Ser. B 51, 67–78 (1991)CrossRefGoogle Scholar
  10. 10.
    Kratochvíl, J.: A special planar satisfiability problem and a consequence of its NP-completeness. Discrete Applied Mathematics 52, 233–252 (1994)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Kynčl, J.: Enumeration of simple complete topological graphs. Electronic Notes in Discrete Mathematics 29, 295–299 (2007)CrossRefGoogle Scholar
  12. 12.
    Kynčl, J., Valtr, P.: On edges crossing few other edges in simple topological complete graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 274–284. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  13. 13.
    Pach, J., Solymosi, J., Tóth, G.: Unavoidable configurations in complete topological graphs. Discrete and Computational Geometry 30, 311–320 (2003)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Pach, J., Tóth, G.: Recognizing string graphs is decidable. Discrete and computational geometry and graph drawing (Columbia, SC, 2001), Discrete and Computational Geometry 28(4), 593–606 (2002)MATHGoogle Scholar
  15. 15.
    Pach, J., Tóth, G.: How many ways can one draw a graph? In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 47–58. Springer, Heidelberg (2004)Google Scholar
  16. 16.
    Richter, R.B., Thomassen, C.: Relations between crossing numbers of complete and complete bipartite graphs. Amer. Math. Monthly 104(2), 131–137 (1997)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Schaefer, M., Sedgwick, E., Štefankovič, D.: Recognizing string graphs in NP. Journal of Computer and System Sciences 67, 365–380 (2003)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Schaefer, M., Štefankovič, D.: Decidability of string graphs. Journal of Computer and System Sciences 68, 319–334 (2004)MATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Shahrokhi, F., Székely, L.A., Vrt’o, I.: Crossing Numbers of Graphs, Lower Bound Techniques and Algorithms: A Survey. In: Tamassia, R., Tollis, I(Y.) G. (eds.) GD 1994. LNCS, vol. 894, pp. 131–142. Springer, Heidelberg (1995)Google Scholar
  20. 20.
    Wagner, U.: On the rectilinear crossing number of complete graphs. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, pp. 583–588. ACM, New York (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jan Kynčl
    • 1
  1. 1.Department of Applied Mathematics and Institute for Theoretical Computer Science, Faculty of Mathematics and PhysicsCharles UniversityPragueCzech Republic

Personalised recommendations