AAAAAA

   
Results: 1-14 |
Results: 14
GRAPHS WITH GIVEN ODD SETS AND THE LEAST NUMBER OF VERTICES
Authors: HAKIMI SL
Citation: Sl. Hakimi, GRAPHS WITH GIVEN ODD SETS AND THE LEAST NUMBER OF VERTICES, Journal of graph theory, 24(1), 1997, pp. 81-83
DISJOINT ROOTED SPANNING-TREES WITH SMALL DEPTHS IN DEBRUIJN AND KAUTZ GRAPHS
Authors: GE ZY HAKIMI SL
Citation: Zy. Ge et Sl. Hakimi, DISJOINT ROOTED SPANNING-TREES WITH SMALL DEPTHS IN DEBRUIJN AND KAUTZ GRAPHS, SIAM journal on computing, 26(1), 1997, pp. 79-92
LOCATING REPLICAS OF A DATABASE ON A NETWORK
Authors: HAKIMI SL SCHMEICHEL EF
Citation: Sl. Hakimi et Ef. Schmeichel, LOCATING REPLICAS OF A DATABASE ON A NETWORK, Networks, 30(1), 1997, pp. 31-36
ORIENTING GRAPHS TO OPTIMIZE REACHABILITY
Authors: HAKIMI SL SCHMEICHEL EF YOUNG NE
Citation: Sl. Hakimi et al., ORIENTING GRAPHS TO OPTIMIZE REACHABILITY, Information processing letters, 63(5), 1997, pp. 229-235
GOSSIPING WITH MULTIPLE SENDS AND RECEIVES
Authors: BAGCHI A SCHMEICHEL EF HAKIMI SL
Citation: A. Bagchi et al., GOSSIPING WITH MULTIPLE SENDS AND RECEIVES, Discrete applied mathematics, 64(2), 1996, pp. 105-116
GLOBALLY OPTIMAL FLOORPLANNING FOR A LAYOUT PROBLEM
Authors: MOH TS CHANG TS HAKIMI SL
Citation: Ts. Moh et al., GLOBALLY OPTIMAL FLOORPLANNING FOR A LAYOUT PROBLEM, IEEE transactions on circuits and systems. 1, Fundamental theory andapplications, 43(9), 1996, pp. 713-720
APPROXIMATION ALGORITHMS FOR THE CAPACITATED PLANT ALLOCATION PROBLEM(VOL 15, PG 115, 1994)
Authors: LABBE M SCHMEICHEL EF HAKIMI SL
Citation: M. Labbe et al., APPROXIMATION ALGORITHMS FOR THE CAPACITATED PLANT ALLOCATION PROBLEM(VOL 15, PG 115, 1994), Operations research letters, 18(4), 1996, pp. 205-205
DEGREE-BOUNDED COLORING OF GRAPHS - VARIATIONS ON A THEME BY BROOKS
Authors: HAKIMI SL MITCHEM J SCHMEICHEL EF
Citation: Sl. Hakimi et al., DEGREE-BOUNDED COLORING OF GRAPHS - VARIATIONS ON A THEME BY BROOKS, Journal of graph theory, 20(2), 1995, pp. 177-194
EDGE-DISJOINT PACKINS OF GRAPHS
Authors: CORNEIL DG MASUYAMA S HAKIMI SL
Citation: Dg. Corneil et al., EDGE-DISJOINT PACKINS OF GRAPHS, Discrete applied mathematics, 50(2), 1994, pp. 135-148
APPROXIMATION ALGORITHMS FOR THE CAPACITATED PLANT ALLOCATION PROBLEM
Authors: LABBE M SCHMEICHEL EF HAKIMI SL
Citation: M. Labbe et al., APPROXIMATION ALGORITHMS FOR THE CAPACITATED PLANT ALLOCATION PROBLEM, Operations research letters, 15(3), 1994, pp. 115-126
PARALLEL INFORMATION DISSEMINATION BY PACKETS
Authors: BAGCHI A SCHMEICHEL EF HAKIMI SL
Citation: A. Bagchi et al., PARALLEL INFORMATION DISSEMINATION BY PACKETS, SIAM journal on computing, 23(2), 1994, pp. 355-372
INFORMATION DISSEMINATION IN DISTRIBUTED SYSTEMS WITH FAULTY UNITS
Authors: BAGCHI A HAKIMI SL
Citation: A. Bagchi et Sl. Hakimi, INFORMATION DISSEMINATION IN DISTRIBUTED SYSTEMS WITH FAULTY UNITS, I.E.E.E. transactions on computers, 43(6), 1994, pp. 698-710
ON MINIMUM FAULT-TOLERANT NETWORKS
Authors: UENO S BAGCHI A HAKIMI SL SCHMEICHEL EF
Citation: S. Ueno et al., ON MINIMUM FAULT-TOLERANT NETWORKS, SIAM journal on discrete mathematics, 6(4), 1993, pp. 565-574
ON LOCATING PATH-SHAPED OR TREE-SHAPED FACILITIES ON NETWORKS
Authors: HAKIMI SL SCHMEICHEL EF LABBE M
Citation: Sl. Hakimi et al., ON LOCATING PATH-SHAPED OR TREE-SHAPED FACILITIES ON NETWORKS, Networks, 23(6), 1993, pp. 543-555
Risultati: 1-14 |