Szegedy walks for arc search in graphs give success probability independent of marked arc when the graph is arc-transitive, ineffective on paths and cycles but effective on K_{n,n}.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Arc search in graphs via Szegedy walks
Szegedy walks for arc search in graphs give success probability independent of marked arc when the graph is arc-transitive, ineffective on paths and cycles but effective on K_{n,n}.