Author:
van Wyk Barend J.,van Wyk Michaël A.,Noel Guillaume
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE Trans. Patt. Anal. Machine Intell. 18(4), 377–388 (1996)
2. Simić, P.D.: Constrained Nets for Graph Matching and Other Quadratic Assignment Problems. Neural Computation 3, 268–281 (1991)
3. Van Wyk, B.J.: Kronecker Product, Successive Projection, and Related Graph Matching Algorithms, PhD Thesis, University of the Witwatersrand, Johannesburg (2003),
http://www.ee.wits.ac.za/comms/output/theses.htm
4. Bertsekas, D.P.: The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial. Interfaces 20, 133–149 (1990)
5. Jonker, R., Volgenant, A.: A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems. Computing 38, 325–340 (1987)