Graph matching and clustering using spectral partitions
- 31 January 2006
- journal article
- Published by Elsevier BV in Pattern Recognition
- Vol. 39 (1), 22-34
- https://doi.org/10.1016/j.patcog.2005.06.014
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Structural graph matching using the EM algorithm and singular value decompositionIeee Transactions On Pattern Analysis and Machine Intelligence, 2001
- Bayesian graph edit distanceIeee Transactions On Pattern Analysis and Machine Intelligence, 2000
- Normalized cuts and image segmentationIeee Transactions On Pattern Analysis and Machine Intelligence, 2000
- A new algorithm for error-tolerant subgraph isomorphism detectionIeee Transactions On Pattern Analysis and Machine Intelligence, 1998
- Structural matching by discrete relaxationIeee Transactions On Pattern Analysis and Machine Intelligence, 1997
- A graduated assignment algorithm for graph matchingIeee Transactions On Pattern Analysis and Machine Intelligence, 1996
- Interlacing eigenvalues and graphsLinear Algebra and its Applications, 1995
- Feature-based correspondence: an eigenvector approachImage and Vision Computing, 1992
- An eigendecomposition approach to weighted graph matching problemsIeee Transactions On Pattern Analysis and Machine Intelligence, 1988
- The String-to-String Correction ProblemJournal of the ACM, 1974