Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference47 articles.
1. 9th DIMACS: Implementation challenge—shortest paths. http://www.dis.uniroma1.it/~challenge9/download.shtml (2005)
2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, New York (1993). Theory, algorithms, and applications
3. Aoshima, K., Iri, M.: Comments on Hadlock’s paper: “Finding a maximum cut of a planar graph in polynomial time”. SIAM J. Comput. 6(1), 86–87 (1977)
4. Barahona, F.: On the computational complexity of Ising spin glass models. J. Phys. A: Math. Gen. 15(10), 3241–3253 (1982)
5. Barahona, F.: The max-cut problem on graphs not contractible to K 5. Oper. Res. Lett. 2(3), 107–111 (1983)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Low-depth Clifford circuits approximately solve MaxCut;Physical Review Research;2024-06-20
2. Utilizing Graph Sparsification for Pre-processing in Max Cut QUBO Solver;Lecture Notes in Computer Science;2024
3. Complexity and Polynomially Solvable Special Cases of QUBO;The Quadratic Unconstrained Binary Optimization Problem;2022
4. Introduction to QUBO;The Quadratic Unconstrained Binary Optimization Problem;2022
5. Quantum Annealing versus Digital Computing;ACM Journal of Experimental Algorithmics;2021-12-31