APA (7th ed.) Citation

Lobe, E., & Lutz, A. (2024). Minor embedding in broken chimera and derived graphs is NP-complete. Theoretical Computer Science, 989, N.PAG. https://doi.org/10.1016/j.tcs.2023.114369

Chicago Style (17th ed.) Citation

Lobe, Elisabeth, and Annette Lutz. "Minor Embedding in Broken Chimera and Derived Graphs Is NP-complete." Theoretical Computer Science 989 (2024): N.PAG. https://doi.org/10.1016/j.tcs.2023.114369.

MLA (9th ed.) Citation

Lobe, Elisabeth, and Annette Lutz. "Minor Embedding in Broken Chimera and Derived Graphs Is NP-complete." Theoretical Computer Science, vol. 989, 2024, p. N.PAG, https://doi.org/10.1016/j.tcs.2023.114369.