Author:
Chapuis Guillaume,Djidjev Hristo,Hahn Georg,Rizk Guillaume
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Modelling and Simulation,Information Systems,Signal Processing,Theoretical Computer Science,Control and Systems Engineering
Reference34 articles.
1. Balas, E., & Yu, C. (1986). Finding a maximum clique in an arbitrary graph. SIAM Journal of Comparative, 15, 1054–1068.
2. Batagelj, V., & Zaversnik, M. (2011). An o(m) algorithm for cores decomposition of networks. Adv Dat An Class, 5(2), 129–145.
3. Boothby, T., King, A., Roy, A. (2016). Fast clique minor generation in Chimera qubit connectivity graphs. Quantum Information Processing, 15(1), 495–508.
4. Boros, E., Hammer, P., Tavares, G. (2006). Preprocessing of Unconstrained Quadratic Binary Optimization. Rutcor Research Report RRR, 10-2006, 1–58.
5. Bunyk, P., Hoskinson, E., Johnson, M., Tolkacheva, E., Altomare, F., Berkley, A., Harris, R., Hilton, J., Lanting, T., Przybysz, A., Whittaker, J. (2014). Architectural considerations in the design of a superconducting quantum annealing processor. IEEE Trans on Appl Superconductivity, 24(4), 1–10.
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献