-
1
-
-
0001943218
-
PBD-closure
-
C.J. Colbourn and J.H. Dinitz (Editors), CRC
-
[1] F.E. Bennett, H.D.O.F. Gronau, A.C.H. Ling, and R.C. Mullin, "PBD-closure," CRC handbook of combinatorial designs, C.J. Colbourn and J.H. Dinitz (Editors), CRC, 1996, pp. 203-213.
-
(1996)
CRC Handbook of Combinatorial Designs
, pp. 203-213
-
-
Bennett, F.E.1
Gronau, H.D.O.F.2
Ling, A.C.H.3
Mullin, R.C.4
-
2
-
-
84947769097
-
Efficient collective communication in all-optical networks
-
[2] J.-C. Bermond, L. Gargano, S. Perennes, A. Rescigno, and U. Vaccaro, "Efficient collective communication in all-optical networks," Lecture notes in computer science, 1996, Vol. 1099, pp. 574-585.
-
(1996)
Lecture Notes in Computer Science
, vol.1099
, pp. 574-585
-
-
Bermond, J.-C.1
Gargano, L.2
Perennes, S.3
Rescigno, A.4
Vaccaro, U.5
-
3
-
-
0001969121
-
Decompositions of complete graphs into isomorphic subgraphs with five vertices
-
[3] J.-C. Bermond, C. Huang, A. Rosa, and D. Sotteau, Decompositions of complete graphs into isomorphic subgraphs with five vertices, Ars Combin 10 (1980), 211-254.
-
(1980)
Ars Combin
, vol.10
, pp. 211-254
-
-
Bermond, J.-C.1
Huang, C.2
Rosa, A.3
Sotteau, D.4
-
4
-
-
0033882608
-
Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks
-
[4] A.L. Chiu and E.H. Modiano, Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks, J Lightwave Technol 18 (2000), 2-12.
-
(2000)
J Lightwave Technol
, vol.18
, pp. 2-12
-
-
Chiu, A.L.1
Modiano, E.H.2
-
7
-
-
84959845492
-
Chromatic numbers for certain graphs
-
[7] R. Laskar and W. Hare, Chromatic numbers for certain graphs, J Lond Math Soc 4 (1972), 489-492.
-
(1972)
J Lond Math Soc
, vol.4
, pp. 489-492
-
-
Laskar, R.1
Hare, W.2
-
8
-
-
0037814323
-
PBDs: Recursive constructions
-
C.J. Colbourn and J.H. Dinitz (Editors), CRC Press, Boca Raton FL
-
[8] R.C. Mullin and H-D.O.F. Gronau, "PBDs: Recursive constructions," CRC handbook of combinatorial designs, C.J. Colbourn and J.H. Dinitz (Editors), CRC Press, Boca Raton FL, 1996, pp. 193-203.
-
(1996)
CRC Handbook of Combinatorial Designs
, pp. 193-203
-
-
Mullin, R.C.1
Gronau, H.-D.O.F.2
-
9
-
-
0002271098
-
Graph decompositions
-
[9] C.A. Rodger, Graph decompositions, Le Matematiche 45 (1990), 119-140.
-
(1990)
Le Matematiche
, vol.45
, pp. 119-140
-
-
Rodger, C.A.1
-
10
-
-
0033439529
-
The ring loading problem
-
[10] A. Schrijver, P. Seymour, and P. Winkler, The ring loading problem, SIAM Rev 41 (1999), 777-791.
-
(1999)
SIAM Rev
, vol.41
, pp. 777-791
-
-
Schrijver, A.1
Seymour, P.2
Winkler, P.3
-
11
-
-
0032785156
-
Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic
-
[11] J.M. Simmons, E.L. Goldstein, and A.A.M. Saleh, Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic, J Lightwave Technol 17 (1999), 48-57.
-
(1999)
J Lightwave Technol
, vol.17
, pp. 48-57
-
-
Simmons, J.M.1
Goldstein, E.L.2
Saleh, A.A.M.3
|