Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference24 articles.
1. Barahona F (1990) Planar multicommodity flows, max cut, and the Chinese postman problem. In: Cook W, Seymour PD (eds) Polyhedral combinatorics, proceedings DIMACS workshop, Morristown, New Jersey, 1989, DIMACS series in discrete mathematics and theoretical computer science vol 1, pp 189–202
2. Barahona F, Grötschel M, Jünger M, Reinelt G (1988) An application of combinatorial optimization to statistical physics and circuit layout design. Oper Res 36:493–513
3. Ben-Ameur W, Mahjoub AR, Neto J (2014) The maximum cut problem. In: Paschos VT (ed) Paradigms of combinatorial optimization, problems and new approaches, 2nd edn. Wiley, Hoboken
4. Bodlaender HL, Jansen K (2000) On the complexity of the maximum cut problem. Nord J Comput 7(1):14–31
5. Bondy JA, Murty USR (2008) Graph theory with applications. Elsevier, New York
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The spectral radius of minor-free graphs;European Journal of Combinatorics;2024-05
2. On the bond polytope;Advances in Geometry;2023-10-01