A comparison of approaches for finding minimum identifying codes on graphs
From MaRDI portal
Publication:296102
DOI10.1007/s11128-016-1240-0zbMath1338.81136arXiv1504.08011OpenAlexW2329390440MaRDI QIDQ296102
Victoria Horan, Steve Adachi, Stanley Bak
Publication date: 14 June 2016
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.08011
Uses Software
Cites Work
- Unnamed Item
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- A case study in programming a quantum annealer for hard operational planning problems
- Identifying codes on directed de Bruijn graphs
- Adiabatic quantum programming: minor embedding with hard faults
- Resource efficient gadgets for compiling adiabatic quantum optimization problems
- On a new class of codes for identifying vertices in graphs
This page was built for publication: A comparison of approaches for finding minimum identifying codes on graphs