On crossings, the Crossing Postman Problem, and the Rural Postman Problem.
- Published in:
- Networks, 1999, v. 34, n. 3, p. 173, doi. 10.1002/(SICI)1097-0037(199910)34:3<173::AID-NET1>3.0.CO;2-W
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1999 AND VI 34 AND IP 3
Results: 8
1
2
Optimal adaptive fault diagnosis for simple multiprocessor systems.
- Published in:
- Networks, 1999, v. 34, n. 3, p. 206, doi. 10.1002/(SICI)1097-0037(199910)34:3<206::AID-NET5>3.0.CO;2-F
- By:
- Publication type:
- Article
3
On the superconnectivity and the conditional diameter of graphs and digraphs.
- Published in:
- Networks, 1999, v. 34, n. 3, p. 197, doi. 10.1002/(SICI)1097-0037(199910)34:3<197::AID-NET4>3.0.CO;2-9
- By:
- Publication type:
- Article
4
Heuristic and exact algorithms for scheduling aircraft landings.
- Published in:
- Networks, 1999, v. 34, n. 3, p. 229, doi. 10.1002/(SICI)1097-0037(199910)34:3<229::AID-NET8>3.0.CO;2-W
- By:
- Publication type:
- Article
5
Tenacity of complete graph products and grids.
- Published in:
- Networks, 1999, v. 34, n. 3, p. 192, doi. 10.1002/(SICI)1097-0037(199910)34:3<192::AID-NET3>3.0.CO;2-R
- By:
- Publication type:
- Article
6
Modeling K-coteries by well-covered graphs.
- Published in:
- Networks, 1999, v. 34, n. 3, p. 221, doi. 10.1002/(SICI)1097-0037(199910)34:3<221::AID-NET7>3.0.CO;2-M
- By:
- Publication type:
- Article
7
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs.
- Published in:
- Networks, 1999, v. 34, n. 3, p. 181, doi. 10.1002/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y
- By:
- Publication type:
- Article
8
Crossing properties of multiterminal cuts.
- Published in:
- Networks, 1999, v. 34, n. 3, p. 215, doi. 10.1002/(SICI)1097-0037(199910)34:3<215::AID-NET6>3.0.CO;2-E
- By:
- Publication type:
- Article