Finding a minimum equivalent graph of a digraph.
- Published in:
- Networks, 1982, v. 12, n. 2, p. 89, doi. 10.1002/net.3230120202
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1982 AND VI 12 AND IP 2
Results: 11
1
2
A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory.
- Published in:
- Networks, 1982, v. 12, n. 2, p. 141, doi. 10.1002/net.3230120206
- By:
- Publication type:
- Article
3
Masthead.
- Published in:
- Networks, 1982, v. 12, n. 2, p. fmi, doi. 10.1002/net.3230120201
- Publication type:
- Article
4
Generalizations of planar graphs.
- Published in:
- Networks, 1982, v. 12, n. 2, p. 127, doi. 10.1002/net.3230120205
- By:
- Publication type:
- Article
5
An algorithm for the equilibrium assignment problem with random link times.
- Published in:
- Networks, 1982, v. 12, n. 2, p. 191, doi. 10.1002/net.3230120209
- By:
- Publication type:
- Article
6
Regenerative simulaton of response times in networks of queues, by D. L. Iglehart and G. S. Shedler, Lecture notes in control and information Sciences, Springer-Verlag, Berlin-Heidelberg-New York, 204 pp. Price: $15.70.
- Published in:
- Networks, 1982, v. 12, n. 2, p. 210, doi. 10.1002/net.3230120211
- Publication type:
- Article
7
On reliability in stochastic graphs.
- Published in:
- Networks, 1982, v. 12, n. 2, p. 119, doi. 10.1002/net.3230120204
- By:
- Publication type:
- Article
8
Minimum width 2-layer layout of a multichanneled system.
- Published in:
- Networks, 1982, v. 12, n. 2, p. 173, doi. 10.1002/net.3230120208
- By:
- Publication type:
- Article
9
Fundamentals of network analysis, by Don T. Phillips and Alberto Garcia-Diaz, Prentice Hall, Englewood Cliffs, NJ, 1981, 474 pp. Price: $26.90.
- Published in:
- Networks, 1982, v. 12, n. 2, p. 209, doi. 10.1002/net.3230120210
- Publication type:
- Article
10
Aggregation and disaggregation in convex network problems.
- Published in:
- Networks, 1982, v. 12, n. 2, p. 101, doi. 10.1002/net.3230120203
- By:
- Publication type:
- Article
11
A decomposition algorithm for locating a shortest path between two nodes in a network.
- Published in:
- Networks, 1982, v. 12, n. 2, p. 161, doi. 10.1002/net.3230120207
- By:
- Publication type:
- Article