Masthead.
- Published in:
- Networks, 1987, v. 17, n. 3, p. fmi, doi. 10.1002/net.3230170301
- Publication type:
- Article
Works matching IS 00283045 AND DT 1987 AND VI 17 AND IP 3
Results: 9
1
2
Digraphs with maximum number of paths and cycles.
- Published in:
- Networks, 1987, v. 17, n. 3, p. 295, doi. 10.1002/net.3230170305
- By:
- Publication type:
- Article
3
Some generalizations of the steiner problem in graphs.
- Published in:
- Networks, 1987, v. 17, n. 3, p. 353, doi. 10.1002/net.3230170309
- By:
- Publication type:
- Article
4
Postman tour on a graph with precedence relation on arcs.
- Published in:
- Networks, 1987, v. 17, n. 3, p. 283, doi. 10.1002/net.3230170304
- By:
- Publication type:
- Article
5
Computing k-shortest path lengths in euclidean networks.
- Published in:
- Networks, 1987, v. 17, n. 3, p. 341, doi. 10.1002/net.3230170308
- By:
- Publication type:
- Article
6
On some matching problems arising in vehicle scheduling models.
- Published in:
- Networks, 1987, v. 17, n. 3, p. 271, doi. 10.1002/net.3230170303
- By:
- Publication type:
- Article
7
An efficient implementation of the 'partan' variant of the linear approximation method for the network equilibrium problem.
- Published in:
- Networks, 1987, v. 17, n. 3, p. 319, doi. 10.1002/net.3230170307
- By:
- Publication type:
- Article
8
A quasi-assignment algorithm for bus scheduling.
- Published in:
- Networks, 1987, v. 17, n. 3, p. 249, doi. 10.1002/net.3230170302
- By:
- Publication type:
- Article
9
A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph.
- Published in:
- Networks, 1987, v. 17, n. 3, p. 307, doi. 10.1002/net.3230170306
- By:
- Publication type:
- Article