| Title:
|
On nonblocking and rearrangeable communication graphs (English) |
| Author:
|
Nieminen, Juhani |
| Language:
|
English |
| Journal:
|
Kybernetika |
| ISSN:
|
0023-5954 |
| Volume:
|
15 |
| Issue:
|
5 |
| Year:
|
1979 |
| Pages:
|
(359)-365 |
| . |
| Category:
|
math |
| . |
| MSC:
|
94C15 |
| idZBL:
|
Zbl 0418.94029 |
| idMR:
|
MR554019 |
| . |
| Date available:
|
2009-09-24T17:09:35Z |
| Last updated:
|
2012-06-05 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/124943 |
| . |
| Reference:
|
[1] V. E. Beneš: Mathematical theory of connecting networks and telephone traffic.Academic Press, New York -London 1965. MR 0210516 |
| Reference:
|
[2] V. E. Beneš: Semilattice characterization of nonblocking networks.Bell System Tech. J. 52 (1973), 697-706. MR 0332349 |
| Reference:
|
[3] K. W. Cattermole: Graph theory and the telecommunications network.Bull. Institute Math. Applic. 11 (1975), 94-107. |
| Reference:
|
[4] J. Nieminen: An optimal processing unit graph.Int. J. Syst. Sci. 4 (1973), 309 - 315. Zbl 0266.90058, MR 0334909 |
| Reference:
|
[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. Zbl 0275.05111, MR 0357241 |
| Reference:
|
[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 0262014 |
| Reference:
|
[7] D. A. Waller: Products of graph projections as a model for multistage communication networks.Electr. Lett. 12 (1976), 206-207. MR 0424439 |
| Reference:
|
[8] B. Zelinka: Tolerance graphs.Comment. Math. Univ. Carolinae 9 (1968), 121 - 131. Zbl 0155.51206, MR 0232698 |
| . |
