1. Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2018). A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing. CDMTCS Report Series 520.
2. Billionnet, A. (2005). Different formulations for solving the heaviest k-subgraph problem. INFOR: Information Systems and Operational Research, 43(3), 171–186.
3. Bollobás, B. (1981). Degree sequences of random graphs. Discrete Mathematics, 33(1), 1–19.
4. Bomze, I. M., Budinich, M., Pardalos, P., & Pelillo, M. (1999). Handbook of combinatorial optimization. In D.-Z. Du & P. M. Pardalos (Eds.), chap. The maximum clique problem (pp. 1–74). Dordrecht: Kluwer Academic Publishers.
5. Boothby, T., King, A. D., & Roy, A. (2016). Fast clique minor generation in Chimera quit connectivity graphs. Quantum Information Processing, 15(1), 495–508.