An O(m log n)-time algorithm for the maximal planar subgraph problem
SIAM Journal on Computing
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast Cyclic Edit Distance Computation with Weighted Edit Costs in Classification
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 4 - Volume 4
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Metamodel Matching: Experiments and Comparison
ICSEA '06 Proceedings of the International Conference on Software Engineering Advances
Ontology Matching
Semi-automatic model integration using matching transformations and weaving models
Proceedings of the 2007 ACM symposium on Applied computing
Semi-automatic model integration using matching transformations and weaving models
Proceedings of the 2007 ACM symposium on Applied computing
Difference computation of large models
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Metamodel Matching for Automatic Model Transformation Generation
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Different models for model matching: An analysis of approaches to support model differencing
CVSM '09 Proceedings of the 2009 ICSE Workshop on Comparison and Versioning of Software Models
Managing Model Adaptation by Precise Detection of Metamodel Changes
ECMDA-FA '09 Proceedings of the 5th European Conference on Model Driven Architecture - Foundations and Applications
MatchBox: combined meta-model matching for semi-automatic mapping generation
Proceedings of the 2010 ACM Symposium on Applied Computing
Schema, ontology and metamodel matching - different, but indeed the same?
MEDI'11 Proceedings of the First international conference on Model and data engineering
Model matching for trace link generation in model-driven software development
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Model matching for Web Services on context dependencies
Proceedings of the 14th International Conference on Information Integration and Web-based Applications & Services
| Hi-index | 0.00 |
A prerequisite for implementing a model transformation is a mapping between metamodel elements. A mapping consists of matches and requires the task of discovering semantic correspondences between elements. This task is called metamodel matching. Recently, semi-automatic matching has been proposed to support transformation development by mapping generation. However, current matching approaches utilize labels, types and similarity propagation approaches rather than graph isomorphism as structural matching. In constrast, we propose to apply an efficient approximate graph edit distance algorithm and present the necessary adjustments and extensions of the general algorithm as well as an optimization with ranked partial seed mappings. We evaluated the algorithm using 20 large-size mappings demonstrating effectively the improvements, especially regarding the correctness of matches found.