Minimum-cost strong network orientation problems: Classification, complexity, and algorithms.
- Published in:
- Networks, 1999, v. 33, n. 1, p. 57, doi. 10.1002/(SICI)1097-0037(199901)33:1<57::AID-NET4>3.0.CO;2-R
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1999 AND VI 33 AND IP 1
Results: 5
1
2
Balanced network flows. II. Simple augmentation algorithms.
- Published in:
- Networks, 1999, v. 33, n. 1, p. 29, doi. 10.1002/(SICI)1097-0037(199901)33:1<29::AID-NET2>3.0.CO;2-U
- By:
- Publication type:
- Article
3
Balanced network flows. III. Strongly polynomial augmentation algorithms.
- Published in:
- Networks, 1999, v. 33, n. 1, p. 43, doi. 10.1002/(SICI)1097-0037(199901)33:1<43::AID-NET3>3.0.CO;2-6
- By:
- Publication type:
- Article
4
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms.
- Published in:
- Networks, 1999, v. 33, n. 1, p. 1, doi. 10.1002/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M
- By:
- Publication type:
- Article
5
Small congestion embedding of graphs into hypercubes.
- Published in:
- Networks, 1999, v. 33, n. 1, p. 71, doi. 10.1002/(SICI)1097-0037(199901)33:1<71::AID-NET5>3.0.CO;2-3
- By:
- Publication type:
- Article