Advertisement

Book embeddings and crossing numbers

  • Farhad Shahrokhi
  • Ondrej Sýkora
  • László A. Székely
  • Imrich Vrt'o
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 903)

Abstract

The paper introduces the book crossing number problem which can be viewed as a variant of the well-known plane and surface crossing number problem or as a generalization of the book embedding problem. The book crossing number of a graph G is defined as the minimum number of edge crossings when the vertices of G are placed on the spine of a k-page book and edges are drawn on pages, so that each edge is contained by one page. We present polynomial time algorithms for drawing graphs in books with small number of crossings. One algorithm is suitable for sparse graphs and gives a drawing in which the number of crossings is within a multiplicative factor of O(log2n) from the optimal one under certain conditions. Using these drawings we improve the best known upper bound on the rectilinear crossing number, provided that m≥4n. We also derive a general lower bound on the book crossing number of any graph and present a second polynomial time algorithm to generate a drawing of any graph with O(m2/k2) many edge crossings. This number of crossings is within a constant multiplicative factor from our general lower bound of Ω(m3/n2k2), provided that m=Θ(n2). For several classes of well-known graphs, we also sharpen our algorithmic upper bounds by giving specific drawings.

Keywords

Polynomial Time Algorithm Hamiltonian Cycle Layout Problem Graph Layout Edge Crossing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ACNS82]
    Ajtai, M., Chvátal, V., Newborn, M.M., Szemerédy, E., “Crossing-free subgraphs”, Annals of Discrete Mathematics 12 (1982), 9–12.Google Scholar
  2. [AES92]
    Alon, N., Spencer, J.H., Erdős, P., “The Probabilistic Method”, Wiley and Sons, New York, 1992.Google Scholar
  3. [BCL76]
    Behzad, M., Chartrand, G., Lesniak-Foster, L., “Graphs and Digraphs”, Wadsworth International Group, Belmont, 1976.Google Scholar
  4. [BK79]
    Bernhart, F., Kainen, P. C., “The book thickness of a graph”, J. Combinatorial Theory, Series B 27 (1979), 320–331.Google Scholar
  5. [BD92]
    Bienstock, D., Dean, N., “New results on rectilinear crossing Numbers and Plane Embeddings”, J. Graph Theorey, 16 (1992), 389–398.Google Scholar
  6. [CCDG82]
    Chinn, P. Z., Chvátalová, L., Dewdney, A. K., Gibbs, N. E., “The bandwidth problem for graphs and matrices—a survey”, J. Graph Theory 6 (1982), 223–253.Google Scholar
  7. [Ch88]
    Chung, F. R. K., “Labeling of graphs”, in: “Selected Topics in Graph Theory 3”, (L. Beineke and R. Wilson, eds.), Academic Press, New York, 1988, 151–168.Google Scholar
  8. [CLR87]
    Chung, F. R. K., Leighton, F. T., Rosenberg, A. L., “Embeddings graphs in books: A layout problem with applications to VLSI design”, SIAM J. Algebraic and Discrete Methods 8 (1987), 33–58.Google Scholar
  9. [CY94]
    Chung, F. R. K., Yau, S.T., “A near optimal algorithm for edge separators”, in: Proc. 28th ACM Annual Symposium on Theory of Computing, ACM Press, 1994, 1–8.Google Scholar
  10. [Dz92]
    Díaz, J., “Graph layout problems”, in: Proc. 17th Intl. Symposium on Mathematical Foundations of Computer Science, LNCS 629, Springer Verlag, Berlin, 1992, 15–23.Google Scholar
  11. [EG73]
    Erdős, P., Guy, R. P., “Crossing number problems”, American Mathematical Monthly 80 (1973), 52–58.Google Scholar
  12. [GJS68]
    Guy, R. P., Jenkyns, T., Schaer, J., “The toroidal crossing number of the complete graph”, J. Combinatorial Theory 4 (1968), 376–390.Google Scholar
  13. [Kn90]
    Kainen, P. C., “The book thickness of a graph, II”, Congressus Numerantium 71 (1990), 127–132.Google Scholar
  14. [Lg83]
    Leighton, F. T., “Complexity Issues in VLSI”, M.I.T. Press, Cambridge, 1983.Google Scholar
  15. [Ls80]
    Leiserson, C. E., “Area efficient graph layouts (for VLSI)”, in: Proc. 21st Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1980, 270–281.Google Scholar
  16. [MKNF87]
    Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T., “On the NP-completeness of a computer network layout problem”, in: Proc. 1987 IEEE Intl. Symposium on Circuits and Systems, IEEE Computer Society Press, Los Alamitos, 1987, 292–295.Google Scholar
  17. [MKNF90]
    Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T., “Crossing minimization in linear embeddings of graphs”, IEEE Transactions on Computers 39 (1990), 124–127.Google Scholar
  18. [MKT71]
    Melikhov, A. N., Koreichik, V. M., Tishchenko, V. A., “Minimization of the number of intersections of edges of a graph”, (in Russian), Vichislityelnie Sistemi Vip. 41 (1971), 32–40.Google Scholar
  19. [MWW88]
    Muder, J. D., Weawer, M. L., West, D. B., “Pagenumber of complete bipartite graphs”, J. Graph Theory 12 (1988), 469–489.Google Scholar
  20. [Nc68]
    Nicolson, T. A. J., “Permutation procedure for minimizing the number of crossings in a network”, Proc. Inst. Elec. Engnrs. 115 (1968), 21–26.Google Scholar
  21. [PSS94]
    Pach, J., Shahrokhi, F., Szegedy, M., “Applications of crossing numbers”, in: Proc. 10th Annual ACM Symposium on Computational Geometry, ACM Press, New York, 1994.Google Scholar
  22. [SS92]
    Shahrokhi, F., Székely, L. A., “Effective lower bounds for crossing number, bisection width and balanced vertex separators in terms of symmetry”, in: Proc. Integer Programming and Combinatorial Optimization, CMU Press, Pittsburgh, 1992, 102–113.Google Scholar
  23. [SSSV]
    Shahrokhi, F., Sýkora, O., Székely, L. A., Vrt'o, I., “The crossing number of a graph on a compact 2-manifold”, Advances in Mathematics, to appear.Google Scholar
  24. [SSSV94]
    Shahrokhi, F., Sykora, O., Székely, L. A., Vrt'o, I., “Improved bounds for the crossing numbers on surfaces of genus g”, in: Proc. 19-th Intl. Workshop on Graph-Theoretic Concepts in Computer Science WG'93, LNCS 790, Springer Verlag, Berlin, 1994, 388–397.Google Scholar
  25. [SV93]
    Sýkora, O., Vrt'o, I., “On crossing numbers of hypercubes and cube connected cycles”, BIT 3 (1993), 232–237.Google Scholar
  26. [U184]
    Ullman, J. D., “Computational Aspects of VLSI”, Computer Science Press, Rockville, 1984.Google Scholar
  27. [Yn86a]
    Yannakakis, M., “Linear and book embeddings of graphs”, in: Proc. Aegean Workshop on Computing, LNCS 227, Springer Verlag, Berlin, 1986, 229–240.Google Scholar
  28. [Yn86b]
    Yannakakis, M., “Four pages are necessary and sufficient for planar graphs”, in: Proc. 18th ACM Annual Symposium on Theory of Computing, ACM Press, New York, 1986, 104–108.Google Scholar
  29. [Zr54]
    Zarankiewicz, K., “On a problem of P. Turán concerning graphs”, Fundamenta Mathematica 41 (1954), 137–145.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Farhad Shahrokhi
    • 1
  • Ondrej Sýkora
    • 2
  • László A. Székely
    • 3
  • Imrich Vrt'o
    • 2
  1. 1.Department of Computer ScienceUniversity of North TexasDentonUSA
  2. 2.Institute for InformaticsSlovak Academy of SciencesBratislavaSlovak Republic
  3. 3.Department of Computer ScienceEőtvős UniversityBudapestHungary

Personalised recommendations