Fast computation of Bipartite graph matching
- 1 August 2014
- journal article
- research article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 45, 244-250
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Pattern analysis with graphs: Parallel work at Bern and YorkPattern Recognition Letters, 2012
- Generalized median graph computation by means of graph embedding in vector spacesPattern Recognition, 2010
- Median graphs: A genetic approach based on new theoretical propertiesPattern Recognition, 2009
- Approximate graph edit distance computation by means of bipartite graph matchingImage and Vision Computing, 2009
- A survey of graph edit distancePattern Analysis and Applications, 2009
- Automatic learning of cost functions for graph edit distanceInformation Sciences, 2007
- Function-described graphs for modelling objects represented by sets of attributed graphsPattern Recognition, 2003
- Graph-based representations and techniques for image processing and image analysisPattern Recognition, 2002
- Symbol recognition by error-tolerant subgraph matching between region adjacency graphsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955