Graph matching using the interference of discrete-time quantum walks

D Emms, RC Wilson, ER Hancock - Image and Vision Computing, 2009 - Elsevier
In this paper, we consider how discrete-time quantum walks can be applied to graph-
matching problems. The matching problem is abstracted using an auxiliary graph that …
被引用次数：35 相关文章

Graph matching using the interference of discrete-time quantum walks

D Emms, RC Wilson, ER Hancock - Image and Vision Computing, 2009 - pure.york.ac.uk
In this paper, we consider how discrete-time quantum walks can be applied to graph-
matching problems. The matching problem is abstracted using an auxiliary graph that …

Graph matching using the interference of discrete-time quantum walks

D Emms, RC Wilson, ER Hancock - Image and Vision Computing, 2009 - dl.acm.org
In this paper, we consider how discrete-time quantum walks can be applied to graph-
matching problems. The matching problem is abstracted using an auxiliary graph that …

Graph matching using the interference of discrete-time quantum walks

D Emms, RC Wilson, ER Hancock - Image and Vision Computing, 2009 - infona.pl
In this paper, we consider how discrete-time quantum walks can be applied to graph-
matching problems. The matching problem is abstracted using an auxiliary graph that …