SCOPUS 정보 검색 플랫폼

Volumn 78, Issue 1-3, 1997, Pages 103-116

Embedding de Bruijn, Kautz and shuffle-exchange networks in books

Author keywords

Bookembedding; De Bruijn digraph; Kautz digraph; Shuffle exchange graph

Indexed keywords

EID: 0141667564 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(97)00009-7 Document Type: Article

Times cited : (19)

References (13)

1
- 0028378703
- Broadcasting and gossiping in de bruijn networks
- J.-C. Bermond, P. Fraigniaud, Broadcasting and gossiping in de Bruijn networks, SIAM J. Comput. 23 (1994) 212-225.
- (1994) SIAM J. Comput. , vol.23 , pp. 212-225
- Bermond, J.-C.¹ Fraigniaud, P.²

3
- 0001026712
- The book thickness of a graph
- F. Bernhart, P.C. Kainen, The book thickness of a graph, J. Combin. Theory Ser. B 27 (1979) 320-331.
- (1979) J. Combin. Theory Ser. B , vol.27 , pp. 320-331
- Bernhart, F.¹ Kainen, P.C.²

4
- 0002758475
- Embedding graphs in books: A layout problem with applications to VLSI design
- F.R.K. Chung, F.T. Leighton, A.L. Rosenberg, Embedding graphs in books: a layout problem with applications to VLSI design, SIAM J. Algebraic Discrete Methods 8 (1987) 33-58.
- (1987) SIAM J. Algebraic Discrete Methods , vol.8 , pp. 33-58
- Chung, F.R.K.¹ Leighton, F.T.² Rosenberg, A.L.³

5
- 0022955403
- Optimal book embeddings of the FFT, Benes, and barrel shifter networks
- R.A. Games, Optimal book embeddings of the FFT, Benes, and barrel shifter networks, Algorithmica 1 (1986) 233-250.
- (1986) Algorithmica , vol.1 , pp. 233-250
- Games, R.A.¹

6
- 0026891110
- The pagenumber of genus g graphs is O(g)
- L.S. Heath, S. Istrail, The pagenumber of genus g graphs is O(g), J. Assoc. Comput. Mach. 39 (1992) 479-501.
- (1992) J. Assoc. Comput. Mach. , vol.39 , pp. 479-501
- Heath, L.S.¹ Istrail, S.²

8
- 0003819663
- Morgan Kaufmann Publishers, San Mateo, CA
- F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes, Morgan Kaufmann Publishers, San Mateo, CA, 1992.
- (1992) Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes
- Leighton, F.T.¹

9
- 38149146031
- Genus g graphs have pagenumber O(√g)
- S.M. Malitz, Genus g graphs have pagenumber O(√g), J. Algorithms 17 (1994) 85-109.
- (1994) J. Algorithms , vol.17 , pp. 85-109
- Malitz, S.M.¹

10
- 84986495445
- Pagenumber of complete bipartite graphs
- D.J. Muder, M.L. Weaver, D.B. West, Pagenumber of complete bipartite graphs, J. Graph Theory 12 (1988) 469-489.
- (1988) J. Graph Theory , vol.12 , pp. 469-489
- Muder, D.J.¹ Weaver, M.L.² West, D.B.³

11
- 0345015240
- Embedding de Bruijn and shuffle-exchange graphs in five pages
- B. Obrenić, Embedding de Bruijn and shuffle-exchange graphs in five pages, SIAM J. Discrete Math. 6 (1993) 642-654.
- (1993) SIAM J. Discrete Math. , vol.6 , pp. 642-654
- Obrenić, B.¹

12
- 0020834827
- The diogenes approach to testable fault-tolerant arrays of processors
- A.L. Rosenberg, The Diogenes approach to testable fault-tolerant arrays of processors, IEEE Trans. Comput. C-32 (1983) 902-910.
- (1983) IEEE Trans. Comput. , vol.C-32 , pp. 902-910
- Rosenberg, A.L.¹

13
- 0024605964
- Embedding planar graphs in four pages
- M. Yannakakis, Embedding planar graphs in four pages, J. Comput. System Sci. 38 (1989) 36-67.
- (1989) J. Comput. System Sci. , vol.38 , pp. 36-67
- Yannakakis, M.¹

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