Spectral bounds for the maximum cut problem.
- Published in:
- Networks, 2008, v. 52, n. 1, p. 8, doi. 10.1002/net.20220
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2008 AND VI 52 AND IP 1
Results: 4
1
2
The computational complexity of graph contractions II: Two tough polynomially solvable cases.
- Published in:
- Networks, 2008, v. 52, n. 1, p. 32, doi. 10.1002/net.20249
- By:
- Publication type:
- Article
3
A Reach and Bound algorithm for acyclic dynamic-programming networks.
- Published in:
- Networks, 2008, v. 52, n. 1, p. 1, doi. 10.1002/net.20219
- By:
- Publication type:
- Article
4
A simplex algorithm for minimum-cost network-flow problems in infinite networks.
- Published in:
- Networks, 2008, v. 52, n. 1, p. 14, doi. 10.1002/net.20221
- By:
- Publication type:
- Article