The strongly connected reliability of complete digraphs.
- Published in:
- Networks, 2005, v. 45, n. 3, p. 165, doi. 10.1002/net.20060
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2005 AND VI 45 AND IP 3
Results: 6
1
2
The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem.
- Published in:
- Networks, 2005, v. 45, n. 3, p. 143, doi. 10.1002/net.20057
- By:
- Publication type:
- Article
3
Leader election in oriented star graphs.
- Published in:
- Networks, 2005, v. 45, n. 3, p. 169, doi. 10.1002/net.20052
- By:
- Publication type:
- Article
4
On restricted connectivities of permutation graphs.
- Published in:
- Networks, 2005, v. 45, n. 3, p. 113, doi. 10.1002/net.20056
- By:
- Publication type:
- Article
5
A branch-and-price algorithm for the capacitated p-median problem.
- Published in:
- Networks, 2005, v. 45, n. 3, p. 125, doi. 10.1002/net.20059
- By:
- Publication type:
- Article
6
Constructions of sparse asymmetric connectors with number theoretic methods.
- Published in:
- Networks, 2005, v. 45, n. 3, p. 119, doi. 10.1002/net.20058
- By:
- Publication type:
- Article