Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree.
- Published in:
- Networks, 1982, v. 12, n. 3, p. 341, doi. 10.1002/net.3230120311
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1982 AND VI 12 AND IP 3
Results: 13
1
2
Maximum flow in networks with a small number of random arc capacities.
- Published in:
- Networks, 1982, v. 12, n. 3, p. 241, doi. 10.1002/net.3230120304
- By:
- Publication type:
- Article
3
On balance in group graphs.
- Published in:
- Networks, 1982, v. 12, n. 3, p. 317, doi. 10.1002/net.3230120308
- By:
- Publication type:
- Article
4
The generalized diameter of a graph.
- Published in:
- Networks, 1982, v. 12, n. 3, p. 335, doi. 10.1002/net.3230120310
- By:
- Publication type:
- Article
5
An optimal 2-FT realization of binary symmetric hierarchical tree systems.
- Published in:
- Networks, 1982, v. 12, n. 3, p. 231, doi. 10.1002/net.3230120303
- By:
- Publication type:
- Article
6
Double-row planar routing and permutation layout.
- Published in:
- Networks, 1982, v. 12, n. 3, p. 287, doi. 10.1002/net.3230120307
- By:
- Publication type:
- Article
7
Decentralized maximum-flow protocols.
- Published in:
- Networks, 1982, v. 12, n. 3, p. 213, doi. 10.1002/net.3230120302
- By:
- Publication type:
- Article
8
Optimization: Theory and applications, by S . S . Rao, Wiley Eastern Limited, New Delhi, 1979,711 pp. Price: $21.95.
- Published in:
- Networks, 1982, v. 12, n. 3, p. 352, doi. 10.1002/net.3230120313
- By:
- Publication type:
- Article
9
The complexity of finding maximum disjoint paths with length constraints.
- Published in:
- Networks, 1982, v. 12, n. 3, p. 277, doi. 10.1002/net.3230120306
- By:
- Publication type:
- Article
10
Masthead.
- Published in:
- Networks, 1982, v. 12, n. 3, p. fmi, doi. 10.1002/net.3230120301
- Publication type:
- Article
11
Network flow programming, by P. A. Jensen and J. W. Barnes, John Wiley and Sons, Inc., New York, 1980, 408 pp. Price: $28.95.
- Published in:
- Networks, 1982, v. 12, n. 3, p. 351, doi. 10.1002/net.3230120312
- By:
- Publication type:
- Article
12
Modular decomposition and reliability computation in stochastic transportation networks having cutnodes.
- Published in:
- Networks, 1982, v. 12, n. 3, p. 255, doi. 10.1002/net.3230120305
- By:
- Publication type:
- Article
13
An algorithm for the steiner problem in graphs.
- Published in:
- Networks, 1982, v. 12, n. 3, p. 323, doi. 10.1002/net.3230120309
- By:
- Publication type:
- Article