A constraint-preserving continuous-time quantum walk on the space of valid vertex covers supplies vertex rankings that improve greedy minimum-vertex-cover heuristics on small random graphs.
Title resolution pending
1 Pith paper cite this work, alongside 35 external citations. Polarity classification is still indexing.
1
Pith paper citing it
35
external citations · OpenAlex
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks
A constraint-preserving continuous-time quantum walk on the space of valid vertex covers supplies vertex rankings that improve greedy minimum-vertex-cover heuristics on small random graphs.