Masthead.
- Published in:
- Networks, 1991, v. 21, n. 2, p. fmi, doi. 10.1002/net.3230210201
- Publication type:
- Article
Works matching IS 00283045 AND DT 1991 AND VI 21 AND IP 2
Results: 8
1
2
Maximum matchings in bipartite graphs via strong spanning trees.
- Published in:
- Networks, 1991, v. 21, n. 2, p. 165, doi. 10.1002/net.3230210203
- By:
- Publication type:
- Article
3
Parametric analysis of optimal facility locations.
- Published in:
- Networks, 1991, v. 21, n. 2, p. 223, doi. 10.1002/net.3230210207
- By:
- Publication type:
- Article
4
Faster parametric shortest path and minimum-balance algorithms.
- Published in:
- Networks, 1991, v. 21, n. 2, p. 205, doi. 10.1002/net.3230210206
- By:
- Publication type:
- Article
5
Unbalanced, capacitated p-median problems on a chain graph with a continuum of link demands.
- Published in:
- Networks, 1991, v. 21, n. 2, p. 133, doi. 10.1002/net.3230210202
- By:
- Publication type:
- Article
6
Polynomial time algorithms on circular-arc overlap graphs.
- Published in:
- Networks, 1991, v. 21, n. 2, p. 195, doi. 10.1002/net.3230210205
- By:
- Publication type:
- Article
7
On the existence of uniformly optimally reliable networks.
- Published in:
- Networks, 1991, v. 21, n. 2, p. 181, doi. 10.1002/net.3230210204
- By:
- Publication type:
- Article
8
Conditional graph connectivity relative to hereditary properties.
- Published in:
- Networks, 1991, v. 21, n. 2, p. 245, doi. 10.1002/net.3230210208
- By:
- Publication type:
- Article