Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-4
|
Results: 4
k-broadcasting in trees
Authors:
Harutyunyan, HA Liestman, AL
Citation:
Ha. Harutyunyan et Al. Liestman, k-broadcasting in trees, NETWORKS, 38(3), 2001, pp. 163-168
Improved upper and lower bounds for k-broadcasting
Authors:
Harutyunyan, HA Liestman, AL
Citation:
Ha. Harutyunyan et Al. Liestman, Improved upper and lower bounds for k-broadcasting, NETWORKS, 37(2), 2001, pp. 94-101
The even adjacency split problem for graphs
Authors:
Cheston, GA Hedetniemi, ST Liestman, AL Stehman, JB
Citation:
Ga. Cheston et al., The even adjacency split problem for graphs, DISCR APP M, 102(3), 2000, pp. 175-188
More broadcast graphs
Authors:
Harutyunyan, HA Liestman, AL
Citation:
Ha. Harutyunyan et Al. Liestman, More broadcast graphs, DISCR APP M, 98(1-2), 1999, pp. 81-102
Risultati:
1-4
|