Back to Search
Start Over
A New Approach to Weighted Graph Matching
- Source :
- IEICE Transactions on Information and Systems. :1580-1583
- Publication Year :
- 2009
- Publisher :
- Institute of Electronics, Information and Communications Engineers (IEICE), 2009.
-
Abstract
- SUMMARY Weighted graph matching is computationally challenging due to the combinatorial nature of the set of permutations. In this paper, a new relaxation approach to weighted graph matching is proposed, by which a new matching algorithm, named alternate iteration algorithm, is designed. It is proved that the algorithm proposed is locally convergent. Experiments are presented to show the effectiveness of the proposed algorithm. eration algorithm.
- Subjects :
- Factor-critical graph
Mathematical optimization
Matching (graph theory)
Computer science
Floyd–Warshall algorithm
Artificial Intelligence
Hardware and Architecture
Kruskal's algorithm
3-dimensional matching
Reverse-delete algorithm
Bipartite graph
Johnson's algorithm
Computer Vision and Pattern Recognition
Suurballe's algorithm
Electrical and Electronic Engineering
Algorithm
Assignment problem
Software
Blossom algorithm
Hopcroft–Karp algorithm
Subjects
Details
- ISSN :
- 17451361 and 09168532
- Database :
- OpenAIRE
- Journal :
- IEICE Transactions on Information and Systems
- Accession number :
- edsair.doi...........9491e666cd9e44562b7fcb9940c059d5