Graph minors from simulated annealing for annealing machines with sparse connectivity
DOI10.1007/978-3-030-04070-3_9zbMath1522.68426OpenAlexW2901723131WikidataQ62669597 ScholiaQ62669597MaRDI QIDQ6073022
Shin-ichi Minato, Takashi Takemoto, Yuki Yoshida, Ichigaku Takigawa, Tamiki Komatsuzaki, Yuya Sugie, Hiroshi Teramoto, Masanao Yamaoka, Normann Mertig, Atsuyoshi Nakamura
Publication date: 16 October 2023
Published in: Theory and Practice of Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-04070-3_9
Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Optimization by Simulated Annealing
- The unconstrained binary quadratic programming problem: a survey
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- Faster parameterized algorithms for minor containment
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Optimised simulated annealing for Ising spin glasses
- Adiabatic quantum programming: minor embedding with hard faults
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
This page was built for publication: Graph minors from simulated annealing for annealing machines with sparse connectivity
