Efficient algorithms for finding maximum cliques of an overlap graph.
- Published in:
- Networks, 1990, v. 20, n. 2, p. 157, doi. 10.1002/net.3230200203
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1990 AND VI 20 AND IP 2
Results: 8
1
2
On cost allocation in communication networks.
- Published in:
- Networks, 1990, v. 20, n. 2, p. 209, doi. 10.1002/net.3230200207
- By:
- Publication type:
- Article
3
The stochastic multicommodity flow problem.
- Published in:
- Networks, 1990, v. 20, n. 2, p. 121, doi. 10.1002/net.3230200202
- By:
- Publication type:
- Article
4
Location of an obnoxious facility on a network: A voting approach.
- Published in:
- Networks, 1990, v. 20, n. 2, p. 197, doi. 10.1002/net.3230200206
- By:
- Publication type:
- Article
5
Masthead.
- Published in:
- Networks, 1990, v. 20, n. 2, p. fmi, doi. 10.1002/net.3230200201
- Publication type:
- Article
6
A class of bounded approximation algorithms for graph partitioning.
- Published in:
- Networks, 1990, v. 20, n. 2, p. 181, doi. 10.1002/net.3230200205
- By:
- Publication type:
- Article
7
A combinatorial problem related to distributed loop networks.
- Published in:
- Networks, 1990, v. 20, n. 2, p. 173, doi. 10.1002/net.3230200204
- By:
- Publication type:
- Article
8
Computing the probability distribution of project duration in a PERT network.
- Published in:
- Networks, 1990, v. 20, n. 2, p. 231, doi. 10.1002/net.3230200208
- By:
- Publication type:
- Article