SCOPUS 정보 검색 플랫폼

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
- Brebner, G., Relating routing graphs and two dimensional array grids, In: Proc. VLSI: Algorithms and Architectures, North Holland, 1985.

2
- 0002436460
- Crossing number problems
- (1973) The American Mathematical Monthly , vol.80 , Issue.1 , pp. 52-58
- Erdös, P.¹ Guy, R.P.²

3
- 0022937687
- A survey of the theory of hypercube graphs
- (1988) Computers and Mathematics with Applications , vol.15 , Issue.4 , pp. 277-289
- Harary, F.¹ Hayes, J.P.² Wu³

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

5
- 0011547582
- A lower bound for crossing numbers of graphs with applications to Kn, Kp,q, and Q(d)
- (1972) J. Combinatorial Theory (B) , vol.12 , pp. 287-298
- Kainen, P.C.¹

6
- 0001179425
- The crossing number of K5,n
- (1971) J. of Combinatorial Theory , vol.9 , pp. 315-323
- Kleitman, D.J.¹

7
- 84936706088
- 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
- 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
- 0011677948
- Bounds for the crossing number of the N-cube
- (1991) Journal of Graph Theory , vol.15 , pp. 81-97
- Madej, T.¹

10
- 84936706093
- 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
- 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
- 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가 분석하여 추출한 것입니다.