View in EDS

Minor embedding in broken chimera and derived graphs is NP-complete.

Saved in:
Bibliographic Details
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
Be the first to leave a comment!
You must be logged in first