GATHERING WITH MINIMUM COMPLETION TIME IN SENSOR TREE NETWORKS.
- Published in:
- Journal of Interconnection Networks, 2010, v. 11, n. 1/2, p. 1, doi. 10.1142/S0219265910002714
- By:
- Publication type:
- Article
Works matching IS 02192659 AND DT 2010 AND VI 11 AND IP 1/2
Results: 4
1
2
MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES.
- Published in:
- Journal of Interconnection Networks, 2010, v. 11, n. 1/2, p. 35, doi. 10.1142/S0219265910002726
- By:
- Publication type:
- Article
3
SUPER SPANNING CONNECTIVITY OF THE FULLY CONNECTED CUBIC NETWORKS.
- Published in:
- Journal of Interconnection Networks, 2010, v. 11, n. 1/2, p. 61, doi. 10.1142/S0219265910002738
- By:
- Publication type:
- Article
4
ON THE EXISTENCE OF DISJOINT SPANNING PATHS IN FAULTY HYPERCUBES.
- Published in:
- Journal of Interconnection Networks, 2010, v. 11, n. 1/2, p. 71, doi. 10.1142/S021926591000274X
- By:
- Publication type:
- Article