Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory.
- Published in:
- Networks, 2003, v. 42, n. 3, p. 169, doi. 10.1002/net.10094
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2003 AND VI 42 AND IP 3
Results: 6
1
2
The linear arrangement problem on recursively constructed graphs.
- Published in:
- Networks, 2003, v. 42, n. 3, p. 165, doi. 10.1002/net.10093
- By:
- Publication type:
- Article
3
A linear algorithm for compact box-drawings of trees.
- Published in:
- Networks, 2003, v. 42, n. 3, p. 160, doi. 10.1002/net.10092
- By:
- Publication type:
- Article
4
Reoptimizing the traveling salesman problem.
- Published in:
- Networks, 2003, v. 42, n. 3, p. 154, doi. 10.1002/net.10091
- By:
- Publication type:
- Article
5
Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem.
- Published in:
- Networks, 2003, v. 42, n. 3, p. 135, doi. 10.1002/net.10090
- By:
- Publication type:
- Article
6
Broadcasting in generalized chordal rings.
- Published in:
- Networks, 2003, v. 42, n. 3, p. 123, doi. 10.1002/net.10088
- By:
- Publication type:
- Article