2008 |
9 | EE | David Emms,
Edwin R. Hancock,
Richard Wilson:
Graph drawing using quantum commute time.
ICPR 2008: 1-4 |
8 | EE | David Emms,
Richard C. Wilson,
Edwin R. Hancock:
Graph Edit Distance without Correspondence from Continuous-Time Quantum Walks.
SSPR/SPR 2008: 5-14 |
2007 |
7 | EE | David Emms,
Edwin R. Hancock,
Richard C. Wilson:
Graph Similarity Using Interfering Quantum Walks.
CAIP 2007: 823-831 |
6 | EE | David Emms,
Richard C. Wilson,
Edwin R. Hancock:
Graph Embedding Using Quantum Commute Times.
GbRPR 2007: 371-382 |
5 | EE | David Emms,
Edwin R. Hancock,
Richard C. Wilson:
A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk.
GbRPR 2007: 81-91 |
2006 |
4 | EE | David Emms,
Edwin R. Hancock,
Richard C. Wilson:
Graph Matching using Interference of Coined Quantum Walks.
ICPR (3) 2006: 133-136 |
3 | EE | David Emms,
Edwin R. Hancock,
Simone Severini,
Richard C. Wilson:
A Matrix Representation of Graphs and its Spectrum as a Graph Invariant.
Electr. J. Comb. 13(1): (2006) |
2005 |
2 | EE | David Emms,
Simone Severini,
Richard C. Wilson,
Edwin R. Hancock:
Coined Quantum Walks Lift the Cospectrality of Graphs and Trees.
EMMCVPR 2005: 332-345 |
1 | EE | David Emms,
Simone Severini,
Richard C. Wilson,
Edwin R. Hancock:
Towards Unitary Representations for Graph Matching.
GbRPR 2005: 153-161 |