메뉴 건너뛰기




Volumn 33, Issue 2, 1993, Pages 232-237

On crossing numbers of hypercubes and cube connected cycles

Author keywords

crossing number; cube connected cycles; F.1.2; G.2.2; hypercube; lower bound

Indexed keywords


EID: 1542711034     PISSN: 00063835     EISSN: 15729125     Source Type: Journal    
DOI: 10.1007/BF01989746     Document Type: Article
Times cited : (29)

References (12)
  • 1
    • 84936706090 scopus 로고    scopus 로고
    • Brebner, G., Relating routing graphs and two dimensional array grids, In: Proc. VLSI: Algorithms and Architectures, North Holland, 1985.
  • 4
    • 84936706087 scopus 로고    scopus 로고
    • Heath, M. I. (editor), Hypercube Multicomputers, Proceedings of the 2-nd Conference on Hypercube Multicomputers, SIAM, 1987.
  • 7
    • 84936706088 scopus 로고    scopus 로고
    • 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
    • 84936706091 scopus 로고    scopus 로고
    • Leiserson, C. E., Area efficient graph layouts (for VLSI), In: Proc. 21-st Annual IEEE Symposium on Foundations of Computer Science, 1980, 270–281.
  • 10
    • 84936706093 scopus 로고    scopus 로고
    • 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
    • 84936706092 scopus 로고    scopus 로고
    • 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
    • 84936706095 scopus 로고    scopus 로고
    • 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.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.