Topological design of centralized computer networks-formulations and algorithms.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 355, doi. 10.1002/net.3230120402
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1982 AND VI 12 AND IP 4
Results: 17
1
2
Determining minimal cuts with a minimal number of arcs.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 493, doi. 10.1002/net.3230120413
- By:
- Publication type:
- Article
3
An efficient algorithm for K shortest simple paths.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 411, doi. 10.1002/net.3230120406
- By:
- Publication type:
- Article
4
A property regarding degenerate pivots for linear assignment networks.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 469, doi. 10.1002/net.3230120411
- By:
- Publication type:
- Article
5
Practical methods of optimization volume 1 : Unconstrained optimization, by R. Flet-cher, Wiley, New York, 1980, 120 pp. Price: $24.50.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 508, doi. 10.1002/net.3230120417
- By:
- Publication type:
- Article
6
An advanced dual incremental network algorithm.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 475, doi. 10.1002/net.3230120412
- By:
- Publication type:
- Article
7
On a measure of communication network vulnerability.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 405, doi. 10.1002/net.3230120405
- By:
- Publication type:
- Article
8
Applied combinatorics, by Alan Tucker, Wiley, New York, 1980,385 pp. Price: $23.95.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 507, doi. 10.1002/net.3230120416
- By:
- Publication type:
- Article
9
A matroid related to finitely chainlike, countably infinite networks.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 453, doi. 10.1002/net.3230120409
- By:
- Publication type:
- Article
10
Masthead.
- Published in:
- Networks, 1982, v. 12, n. 4, p. fmi, doi. 10.1002/net.3230120401
- Publication type:
- Article
11
Networks immune to isolated line failures.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 393, doi. 10.1002/net.3230120404
- By:
- Publication type:
- Article
12
Optimality in nonlinear programming: A feasible directions approach, by A. Ben-Israel, A. Ben-Td, and S. Zlobec, Wiley, New York, 1981, 144 pp. Price: $21.95.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 506, doi. 10.1002/net.3230120415
- By:
- Publication type:
- Article
13
Polynomial algorithms for estimating network reliability.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 439, doi. 10.1002/net.3230120408
- By:
- Publication type:
- Article
14
Efficient algorithms for interval graphs and circular-arc graphs.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 459, doi. 10.1002/net.3230120410
- By:
- Publication type:
- Article
15
A 1-matching blossom-type algorithm for edge covering problems.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 379, doi. 10.1002/net.3230120403
- By:
- Publication type:
- Article
16
Communications network analysis, by Howard Cravis, Lexington Books, Lexington, MA, 1981, 144pp. Price not given.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 505, doi. 10.1002/net.3230120414
- By:
- Publication type:
- Article
17
Circular permutation graphs.
- Published in:
- Networks, 1982, v. 12, n. 4, p. 429, doi. 10.1002/net.3230120407
- By:
- Publication type:
- Article