The complexity of minimum cut and maximum flow problems in an acyclic network.
- Published in:
- Networks, 1987, v. 17, n. 4, p. 387, doi. 10.1002/net.3230170403
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1987 AND VI 17 AND IP 4
Results: 7
1
2
Algorithms for maximum k-colorings and k-coverings of transitive graphs.
- Published in:
- Networks, 1987, v. 17, n. 4, p. 465, doi. 10.1002/net.3230170407
- By:
- Publication type:
- Article
3
An algorithmic framework for the matching problem in some hypergraphs.
- Published in:
- Networks, 1987, v. 17, n. 4, p. 365, doi. 10.1002/net.3230170402
- By:
- Publication type:
- Article
4
Linear placement algorithms and applications to VLSI design.
- Published in:
- Networks, 1987, v. 17, n. 4, p. 439, doi. 10.1002/net.3230170406
- By:
- Publication type:
- Article
5
Masthead.
- Published in:
- Networks, 1987, v. 17, n. 4, p. fmi, doi. 10.1002/net.3230170401
- Publication type:
- Article
6
Accelerated branch exchange heuristics for symmetric traveling salesman problems.
- Published in:
- Networks, 1987, v. 17, n. 4, p. 423, doi. 10.1002/net.3230170405
- By:
- Publication type:
- Article
7
Data transfers in networks with transceivers.
- Published in:
- Networks, 1987, v. 17, n. 4, p. 393, doi. 10.1002/net.3230170404
- By:
- Publication type:
- Article