Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
An algorithm for solving linear programming programs in O(n3L) operations
Progress in Mathematical Programming Interior-point and related methods
Linear programming and network flows (2nd ed.)
Linear programming and network flows (2nd ed.)
Fuzzy Sets and Systems: Theory and Applications
Fuzzy Sets and Systems: Theory and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Matching and Indexing of Graph Models in Content-Based Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ImageMap: An Image Indexing Method Based on Spatial Similarity
IEEE Transactions on Knowledge and Data Engineering
A RKHS Interpolator-Based Graph Matching Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Non-bayesian Graph Matching without Explicit Compatibility Calculations
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
A New Error-Correcting Distance for Attributed Relational Graph Problems
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
An approach to a feature-based comparison of solid models of machined parts
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
A Binary Linear Programming Formulation of the Graph Edit Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Image and Vision Computing
A novel optimizing network architecture with applications
Neural Computation
A combinatorial approach to multi-domain sketch recognition
SBIM '07 Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling
A Path Following Algorithm for Graph Matching
ICISP '08 Proceedings of the 3rd international conference on Image and Signal Processing
Many-to-Many Matching under the l1 Norm
ICIAP '09 Proceedings of the 15th International Conference on Image Analysis and Processing
Attributed relational graph matching based on the nested assignment structure
Pattern Recognition
Comparing stars: on approximating graph edit distance
Proceedings of the VLDB Endowment
Polyhedral object recognition by indexing
Pattern Recognition
Comparing fuzzy data sets by means of graph matching technique
ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
Using eigen-decomposition method for weighted graph matching
ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
Constraint-based graph matching
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Many-to-many graph matching: a continuous relaxation approach
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Measuring 3D shape similarity by graph-based matching of the medial scaffolds
Computer Vision and Image Understanding
Computer Vision and Image Understanding
Efficient many-to-many feature matching under the l1 norm
Computer Vision and Image Understanding
High efficiency and quality: large graphs matching
Proceedings of the 20th ACM international conference on Information and knowledge management
WSM: a novel algorithm for subgraph matching in large weighted graphs
Journal of Intelligent Information Systems
Maximum likelihood method for parameter estimation of bell-shaped functions on graphs
Pattern Recognition Letters
Faster subgraph isomorphism detection by well-founded total order indexing
Pattern Recognition Letters
Graph averaging as a means to compare multichannel EEG coherence networks
EG VCBM'10 Proceedings of the 2nd Eurographics conference on Visual Computing for Biology and Medicine
Finding email correspondents in online social networks
World Wide Web
A spectral-multiplicity-tolerant approach to robust graph matching
Pattern Recognition
High efficiency and quality: large graphs matching
The VLDB Journal — The International Journal on Very Large Data Bases
Using local similarity measures to efficiently address approximate graph matching
Discrete Applied Mathematics
| Hi-index | 0.14 |
A linear programming (LP) approach is proposed for the weighted graph matching problem. A linear program is obtained by formulating the graph matching problem in L/sub 1/ norm and then transforming the resulting quadratic optimization problem to a linear one. The linear program is solved using a simplex-based algorithm. Then, approximate 0-1 integer solutions are obtained by applying the Hungarian method on the real solutions of the linear program. The complexity of the proposed algorithm is polynomial time, and it is O(n/sup 6/L) for matching graphs of size n. The developed algorithm is compared to two other algorithms. One is based on an eigendecomposition approach and the other on a symmetric polynomial transform. Experimental results showed that the LP approach is superior in matching graphs than both other methods.