Works matching IS 00283045 AND DT 2003 AND VI 42 AND IP 4
Results: 4
On the power of BFS to determine a graph's diameter (An expanded abstract of this paper appeared in the Proceedings of the LATIN 2002, S. Rajsbaum (Editor), LNCS 2286, Springer, Berlin, 2002, pp. 209223).
- Published in:
- Networks, 2003, v. 42, n. 4, p. 209, doi. 10.1002/net.10098
- By:
- Publication type:
- Article
A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks.
- Published in:
- Networks, 2003, v. 42, n. 4, p. 202, doi. 10.1002/net.10097
- By:
- Publication type:
- Article
Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs.
- Published in:
- Networks, 2003, v. 42, n. 4, p. 189, doi. 10.1002/net.10096
- By:
- Publication type:
- Article
Unilaterally connected large digraphs and generalized cycles.
- Published in:
- Networks, 2003, v. 42, n. 4, p. 181
- By:
- Publication type:
- Article