Subject
General Computer Science,Theoretical Computer Science
Reference32 articles.
1. 1-planarity of graphs with a rotation system;Auer;J. Graph Algorithms Appl.,2015
2. Parameterized complexity of 1-planarity;Bannister,2013
3. On the computational complexity of Ising spin glass models;Barahona;J. Phys. A, Math. Gen.,1982
4. Balancing Signed Toroidal Graphs in Polynomial Time;Barahona,1983
5. The max-cut problem on graphs not contractible to K5;Barahona;Oper. Res. Lett.,1983
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Delta invariant for Eulerian digraphs;Theoretical Computer Science;2022-09
2. Parameterized analysis and crossing minimization problems;Computer Science Review;2022-08
3. Complexity and Polynomially Solvable Special Cases of QUBO;The Quadratic Unconstrained Binary Optimization Problem;2022
4. Quantum Annealing versus Digital Computing;ACM Journal of Experimental Algorithmics;2021-12-31