Minor embedding in broken chimera and derived graphs is NP-complete.
Saved in:
| Title: | Minor embedding in broken chimera and derived graphs is NP-complete. |
|---|---|
| Authors: | Lobe, Elisabeth1, elisabeth.lobe@dlr.de, Lutz, Annette2 |
| Source: | Theoretical Computer Science; Mar2024, Vol. 989, pN.PAG-N.PAG, 1p |
| Database: | Applied Science & Technology Source |
| ISSN: | 03043975 |
|---|---|
| DOI: | 10.1016/j.tcs.2023.114369 |
