Skip to main content
SpringerLink
Log in

On crossing numbers of hypercubes and cube connected cycles

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

We prove tight bounds for crossing numbers of hypercube and cube connected cycles (CCC) graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Brebner, G.,Relating routing graphs and two dimensional array grids, In: Proc. VLSI:Algorithms and Architectures, North Holland, 1985.

  2. Erdös, P. and Guy, R. P.,Crossing number problems, American Mathematical Monthly, 80, 1, 1973, 52–58.

    Google Scholar 

  3. Harary, F., Hayes, J. P. and Horng-Jyh Wu,A survey of the theory of hypercube graphs, Computers and Mathematics with Applications, 15, 4, 1988, 277–289.

    Google Scholar 

  4. Heath, M. I. (editor),Hypercube Multicomputers, Proceedings of the 2-nd Conference on Hypercube Multicomputers, SIAM, 1987.

  5. Kainen, P. C.,A lower bound for crossing numbers of graphs with applications to K n ,K p,q , andQ(d), J. Combinatorial Theory (B), 12, 1972, 287–298.

    Google Scholar 

  6. Kleitman, D. J.,The crossing number of K 5,n , J. of Combinatorial Theory 9, 1971, 315–323.

    Google Scholar 

  7. Leighton, F. T.,New lower bound techniques for VLSI, In: Proc. 22-nd Annual IEEE Symposium on Foundations of Computer Science, 1981, 1–12.

  8. Leiserson, C. E.,Area efficient graph layouts (for VLSI), In: Proc. 21-st Annual IEEE Symposium on Foundations of Computer Science, 1980, 270–281.

  9. Madej, T.,Bounds for the crossing number of the N-cube, J. Graph Theory, 15, 1991, 81–97.

    Google Scholar 

  10. Preparata, F. P. and Vuillemin, J. E.,The cube-connected cycles: a versatile network for parallel computation, In: Proc. 20-th Annual IEEE Symposium on Foundations of Computer Science, 1979, 140–147.

  11. Shahrokhi, F. and Székely, L. A.,An algebraic approach to the uniform concurrent multicommodity flow problem: theory and applications, Tech. Rep. CRPDC-91-4, Dept. Comp. Sci., Univ. North Texas, 1991.

  12. Shahrokhi, F. and Székely, L. A.,Effective lower bounds for crossing number, bisection width and balanced vertex separators in terms of symmetry, In: Proc. 2-nd IPCO Conference, Pittsburgh, 1992.

Download references

Author information

Authors and Affiliations

  1. Institute for Informatics, Slovak Academy of Sciences, Dúbravská 9, 842 35, Bratislava, Czecho-Slovakia

    Ondrej Sýkora & Imrich Vrťo

Authors
  1. Ondrej Sýkora
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Imrich Vrťo
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The research of both authors was supported by Alexander von Humboldt Foundation, Bonn, Germany.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sýkora, O., Vrťo, I. On crossing numbers of hypercubes and cube connected cycles. BIT 33, 232–237 (1993). https://doi.org/10.1007/BF01989746

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01989746

CR Categories

Key Words

Search

Navigation