Dual algorithms for the shortest path tree problem.
- Published in:
- Networks, 1997, v. 29, n. 2, p. 125, doi. 10.1002/(SICI)1097-0037(199703)29:2<125::AID-NET7>3.0.CO;2-L
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1997 AND VI 29 AND IP 2
Results: 7
1
2
Efficient path and vertex exchange in steiner tree algorithms.
- Published in:
- Networks, 1997, v. 29, n. 2, p. 89, doi. 10.1002/(SICI)1097-0037(199703)29:2<89::AID-NET3>3.0.CO;2-7
- By:
- Publication type:
- Article
3
A secure voting system on a public network.
- Published in:
- Networks, 1997, v. 29, n. 2, p. 81, doi. 10.1002/(SICI)1097-0037(199703)29:2<81::AID-NET2>3.0.CO;2-7
- By:
- Publication type:
- Article
4
Algorithms for computing message delay for wireless networks.
- Published in:
- Networks, 1997, v. 29, n. 2, p. 117, doi. 10.1002/(SICI)1097-0037(199703)29:2<117::AID-NET6>3.0.CO;2-M
- By:
- Publication type:
- Article
5
Balanced graphs and network flows.
- Published in:
- Networks, 1997, v. 29, n. 2, p. 77, doi. 10.1002/(SICI)1097-0037(199703)29:2<77::AID-NET1>3.0.CO;2-8
- By:
- Publication type:
- Article
6
A note on Bertsekas' small-label-first strategy.
- Published in:
- Networks, 1997, v. 29, n. 2, p. 111, doi. 10.1002/(SICI)1097-0037(199703)29:2<111::AID-NET5>3.0.CO;2-M
- By:
- Publication type:
- Article
7
The tree center problems and the relationship with the bottleneck knapsack problems.
- Published in:
- Networks, 1997, v. 29, n. 2, p. 107, doi. 10.1002/(SICI)1097-0037(199703)29:2<107::AID-NET4>3.0.CO;2-N
- By:
- Publication type:
- Article