-
2
-
-
0002555329
-
De Bruijn and Kautz networks: A competitor for the hypercube?
-
F. Andre, J.P. Verjus (Eds.), North-Holland, Amsterdam
-
J.C. Bermond, C. Peyrat, de Bruijn and Kautz networks: a competitor for the hypercube?, in: F. Andre, J.P. Verjus (Eds.), Hypercube and Distributed Computers, North-Holland, Amsterdam, 1989 pp. 279-294.
-
(1989)
Hypercube and Distributed Computers
, pp. 279-294
-
-
Bermond, J.C.1
Peyrat, C.2
-
5
-
-
0042659960
-
Modeling of interconnection networks using de Bruijn graphs
-
A. Vitanyi (Ed.), Budapest
-
J. Bond, A. Ivanyi, Modeling of interconnection networks using de Bruijn graphs, in: A. Vitanyi (Ed.), Proc. 3rd Conf. of Program Designers, Budapest, 1987, pp. 75-88.
-
(1987)
Proc. 3rd Conf. of Program Designers
, pp. 75-88
-
-
Bond, J.1
Ivanyi, A.2
-
9
-
-
0042158984
-
On hamiltonian consecutive-d digraphs
-
Warsaw
-
D.-Z. Du, D.F. Hsu, On hamiltonian consecutive-d digraphs, in: Combinatorics and Graph Theory, Banach Center Publication, vol. 25, Warsaw, 1989, pp. 47-55.
-
(1989)
Combinatorics and Graph Theory, Banach Center Publication
, vol.25
, pp. 47-55
-
-
Du, D.-Z.1
Hsu, D.F.2
-
10
-
-
0003170821
-
Hamiltonian property of d-consecutive digraphs
-
D.-Z. Du, D.F. Hsu, F.K. Hwang, Hamiltonian property of d-consecutive digraphs, Math. Comput. Modeling 17 (11) (1993) 61-63.
-
(1993)
Math. Comput. Modeling
, vol.17
, Issue.11
, pp. 61-63
-
-
Du, D.-Z.1
Hsu, D.F.2
Hwang, F.K.3
-
11
-
-
0040868008
-
The hamiltonian property of generalized de Bruijn digraphs
-
D.-Z. Du, D.F. Hsu, F.K. Hwang, X.M. Zhang, The hamiltonian property of generalized de Bruijn digraphs, J. Combin. Theory, Ser. B 52 (1991) 1-8.
-
(1991)
J. Combin. Theory, Ser. B
, vol.52
, pp. 1-8
-
-
Du, D.-Z.1
Hsu, D.F.2
Hwang, F.K.3
Zhang, X.M.4
-
12
-
-
0042659956
-
Modifications of consecutive-d digraphs
-
D.F. Hsu, A.L. Rosenberg, D. Soteau (Eds.), American Mathematical Society, Providence, RI
-
D.-Z. Du, D.F. Hsu, D.J. Kleitman, Modifications of consecutive-d digraphs, in: D.F. Hsu, A.L. Rosenberg, D. Soteau (Eds.), Interconnection Networks and Mapping and Scheduling Parallel Computations, American Mathematical Society, Providence, RI, 1994, pp. 75-85.
-
(1994)
Interconnection Networks and Mapping and Scheduling Parallel Computations
, pp. 75-85
-
-
Du, D.-Z.1
Hsu, D.F.2
Kleitman, D.J.3
-
15
-
-
0003147073
-
Generalized de Bruijn digraphs
-
D.-Z. Du, F.K. Hwang, Generalized de Bruijn digraphs, Networks 18 (1988) 27-33.
-
(1988)
Networks
, vol.18
, pp. 27-33
-
-
Du, D.-Z.1
Hwang, F.K.2
-
16
-
-
0021422681
-
Line digraph iterations and the (d,k) digraph problem
-
M.A. Fiol, J.L.A. Yebra, I. Alegre, Line digraph iterations and the (d,k) digraph problem, IEEE Trans. Comput. C-33 (1984) 702-713.
-
(1984)
IEEE Trans. Comput.
, vol.C-33
, pp. 702-713
-
-
Fiol, M.A.1
Yebra, J.L.A.2
Alegre, I.3
-
17
-
-
0040817748
-
Vosperian and superconnected abelian Cayley digraphs
-
Y.O. Hamidoune, A.S. Llado, O. Serra, Vosperian and superconnected abelian Cayley digraphs, Graphs Combin. 7 (1991) 143-152.
-
(1991)
Graphs Combin.
, vol.7
, pp. 143-152
-
-
Hamidoune, Y.O.1
Llado, A.S.2
Serra, O.3
-
21
-
-
0023383399
-
The hamiltonian property of linear functions
-
F.K. Hwang, The hamiltonian property of linear functions, Oper. Res. Lett. 6 (1987) 125-127.
-
(1987)
Oper. Res. Lett.
, vol.6
, pp. 125-127
-
-
Hwang, F.K.1
-
22
-
-
0019579044
-
Design to minimize a diameter on building block network
-
M. Imase, M. Itoh, Design to minimize a diameter on Building block network, IEEE Trans. Comput. C-30 (1981) 439-443.
-
(1981)
IEEE Trans. Comput.
, vol.C-30
, pp. 439-443
-
-
Imase, M.1
Itoh, M.2
-
23
-
-
0020795920
-
A design for directed graph with minimum diameter
-
M. Imase, M. Itoh, A design for directed graph with minimum diameter, IEEE Trans. Comput. C-32 (1983) 782-784.
-
(1983)
IEEE Trans. Comput.
, vol.C-32
, pp. 782-784
-
-
Imase, M.1
Itoh, M.2
-
24
-
-
0022024631
-
Connectivity of regular directed graphs with small diameter
-
M. Imase, T. Soneoka, K. Okada, Connectivity of regular directed graphs with small diameter, IEEE Trans. Comput. C-34 (1985) 267-273.
-
(1985)
IEEE Trans. Comput.
, vol.C-34
, pp. 267-273
-
-
Imase, M.1
Soneoka, T.2
Okada, K.3
-
25
-
-
0022769143
-
A fault tolerant processor interconnection network
-
M. Imase, I. Soneoka, K. Okada, A fault tolerant processor interconnection network, Systems and Computers in Japan 17 (8) (1986) 21-30.
-
(1986)
Systems and Computers in Japan
, vol.17
, Issue.8
, pp. 21-30
-
-
Imase, M.1
Soneoka, I.2
Okada, K.3
-
28
-
-
0042644459
-
General properties of c-circulant digraphs
-
M. Mora, O. Serra, M.A. Fiol, General properties of c-circulant digraphs, Ars Combin. 25C (1988) 241-252.
-
(1988)
Ars Combin.
, vol.25 C
, pp. 241-252
-
-
Mora, M.1
Serra, O.2
Fiol, M.A.3
-
29
-
-
0020237967
-
On digraphs with minimum diameter and maximum connectivity
-
S.M. Reddy, J.G. Kuhl, S.H. Hosseini, H. Lee, On digraphs with minimum diameter and maximum connectivity, Proc. 20th Annual Allerton Conf., 1982, pp. 1018-1026.
-
(1982)
Proc. 20th Annual Allerton Conf.
, pp. 1018-1026
-
-
Reddy, S.M.1
Kuhl, J.G.2
Hosseini, S.H.3
Lee, H.4
-
31
-
-
38249019633
-
Design of d-connected digraph with a minimum number of edges and a quasiminimal diameter I
-
T. Soneoka, H. Nakada, M. Imase, Design of d-connected digraph with a minimum number of edges and a quasiminimal diameter I, Discrete Appl, Math. 27 (1990) 255-265.
-
(1990)
Discrete Appl, Math.
, vol.27
, pp. 255-265
-
-
Soneoka, T.1
Nakada, H.2
Imase, M.3
-
32
-
-
0042659949
-
Design of d-connected digraph with a minimum number of edges and a quasiminimal diameter II
-
T. Soneoka, M. Imase, Y. Manabe, Design of d-connected digraph with a minimum number of edges and a quasiminimal diameter II, Discrete Appl. Math. 64 (1996) 267-279.
-
(1996)
Discrete Appl. Math.
, vol.64
, pp. 267-279
-
-
Soneoka, T.1
Imase, M.2
Manabe, Y.3
|