Introductory combinatorics, by K. P. Bogart, Pitman, Boston, 1983, 388 pp. Price: $26.95.
- Published in:
- Networks, 1986, v. 16, n. 2, p. 237, doi. 10.1002/net.3230160210
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1986 AND VI 16 AND IP 2
Results: 10
1
2
Iterative algorithms for generating minimal cutsets in directed graphs.
- Published in:
- Networks, 1986, v. 16, n. 2, p. 133, doi. 10.1002/net.3230160203
- By:
- Publication type:
- Article
3
The minimum augmentation of a directed tree to a k-edge-connected directed graph.
- Published in:
- Networks, 1986, v. 16, n. 2, p. 181, doi. 10.1002/net.3230160207
- By:
- Publication type:
- Article
4
Configuration of physical distribution networks.
- Published in:
- Networks, 1986, v. 16, n. 2, p. 113, doi. 10.1002/net.3230160202
- By:
- Publication type:
- Article
5
Underlying properties of oriented graphs.
- Published in:
- Networks, 1986, v. 16, n. 2, p. 175, doi. 10.1002/net.3230160206
- By:
- Publication type:
- Article
6
Masthead.
- Published in:
- Networks, 1986, v. 16, n. 2, p. fmi, doi. 10.1002/net.3230160201
- Publication type:
- Article
7
On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints.
- Published in:
- Networks, 1986, v. 16, n. 2, p. 161, doi. 10.1002/net.3230160205
- By:
- Publication type:
- Article
8
Network decomposition for the optimization of connection structures.
- Published in:
- Networks, 1986, v. 16, n. 2, p. 205, doi. 10.1002/net.3230160209
- By:
- Publication type:
- Article
9
Implementation of algorithms for K shortest loopless paths.
- Published in:
- Networks, 1986, v. 16, n. 2, p. 149, doi. 10.1002/net.3230160204
- By:
- Publication type:
- Article
10
Optimally reliable graphs for both edge and vertex failures.
- Published in:
- Networks, 1986, v. 16, n. 2, p. 199, doi. 10.1002/net.3230160208
- By:
- Publication type:
- Article