Geodesic
On nonblocking and rearrangeable communication graphs
Kybernetika, Tome 15 (1979) no. 5, pp. 359-365 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 94C15 
@article{KYB_1979_15_5_a2,
     author = {Nieminen, Juhani},
     title = {On nonblocking and rearrangeable communication graphs},
     journal = {Kybernetika},
     pages = {359--365},
     year = {1979},
     volume = {15},
     number = {5},
     mrnumber = {554019},
     zbl = {0418.94029},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1979_15_5_a2/}
}
TY  - JOUR
AU  - Nieminen, Juhani
TI  - On nonblocking and rearrangeable communication graphs
JO  - Kybernetika
PY  - 1979
SP  - 359
EP  - 365
VL  - 15
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/KYB_1979_15_5_a2/
LA  - en
ID  - KYB_1979_15_5_a2
ER  - 
%0 Journal Article
%A Nieminen, Juhani
%T On nonblocking and rearrangeable communication graphs
%J Kybernetika
%D 1979
%P 359-365
%V 15
%N 5
%U http://geodesic.mathdoc.fr/item/KYB_1979_15_5_a2/
%G en
%F KYB_1979_15_5_a2
Nieminen, Juhani. On nonblocking and rearrangeable communication graphs. Kybernetika, Tome 15 (1979) no. 5, pp. 359-365. http://geodesic.mathdoc.fr/item/KYB_1979_15_5_a2/

[1] V. E. Beneš: Mathematical theory of connecting networks and telephone traffic. Academic Press, New York -London 1965. | MR

[2] V. E. Beneš: Semilattice characterization of nonblocking networks. Bell System Tech. J. 52 (1973), 697-706. | MR

[3] K. W. Cattermole: Graph theory and the telecommunications network. Bull. Institute Math. Applic. 11 (1975), 94-107.

[4] J. Nieminen: An optimal processing unit graph. Int. J. Syst. Sci. 4 (1973), 309 - 315. | MR | Zbl

[5] J. Nieminen: A classification of the vertices of an undirected communication graph G generating a congruence relation on G. Wiss. Z. TH Ilmenau 20 (1974), 55 - 62. | MR | Zbl

[6] K. Takagi: Design of multi-stage link systems by means of optimum, channel graphs. Electr. and Comm. Japan 51-A, (1968), 4, 37-46. | MR

[7] D. A. Waller: Products of graph projections as a model for multistage communication networks. Electr. Lett. 12 (1976), 206-207. | MR

[8] B. Zelinka: Tolerance graphs. Comment. Math. Univ. Carolinae 9 (1968), 121 - 131. | MR | Zbl