An efficiently solvable case of the minimum weight equivalent subgraph problem.
- Published in:
- Networks, 1985, v. 15, n. 2, p. 217, doi. 10.1002/net.3230150207
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1985 AND VI 15 AND IP 2
Results: 11
1
2
Combinatorial optimization problems in the analysis and design of probabilistic networks.
- Published in:
- Networks, 1985, v. 15, n. 2, p. 257, doi. 10.1002/net.3230150210
- By:
- Publication type:
- Article
3
Fault-tolerant broadcast graphs.
- Published in:
- Networks, 1985, v. 15, n. 2, p. 159, doi. 10.1002/net.3230150203
- By:
- Publication type:
- Article
4
Rectangular duals of planar graphs.
- Published in:
- Networks, 1985, v. 15, n. 2, p. 145, doi. 10.1002/net.3230150202
- By:
- Publication type:
- Article
5
Minimum cuts, modular functions, and matroid polyhedra.
- Published in:
- Networks, 1985, v. 15, n. 2, p. 205, doi. 10.1002/net.3230150206
- By:
- Publication type:
- Article
6
Masthead.
- Published in:
- Networks, 1985, v. 15, n. 2, p. fmi, doi. 10.1002/net.3230150201
- Publication type:
- Article
7
The continuous m-center problem on a network.
- Published in:
- Networks, 1985, v. 15, n. 2, p. 191, doi. 10.1002/net.3230150205
- By:
- Publication type:
- Article
8
Network reliability analysis using 2-connected digraph reductions.
- Published in:
- Networks, 1985, v. 15, n. 2, p. 239, doi. 10.1002/net.3230150209
- By:
- Publication type:
- Article
9
Linear programming, by Katta G. Murty, John Wiley & Sons, New York, 1983, 482 pp.
- Published in:
- Networks, 1985, v. 15, n. 2, p. 273, doi. 10.1002/net.3230150211
- By:
- Publication type:
- Article
10
A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability.
- Published in:
- Networks, 1985, v. 15, n. 2, p. 173, doi. 10.1002/net.3230150204
- By:
- Publication type:
- Article
11
The search value of a network.
- Published in:
- Networks, 1985, v. 15, n. 2, p. 229, doi. 10.1002/net.3230150208
- By:
- Publication type:
- Article