@inbook{bb5f4ca021b247759ce23cca9063c716,
title = "Graph matching algorithms for business process model similarity search",
abstract = "We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specaifically application of graph matching algorithms to this similarity search problem. Since the corresponding graph matching problem is NP-complete, we seek to find a compromise between computational complexity and quality of the computed ranking. Using a repository of 100 process models, we evaluate four graph matching algorithms, ranging from a greedy one to a relatively exhaustive one. The results show that the mean average precision obtained by a fast greedy algorithm is close to that obtained with the most exhaustive algorithm.",
author = "R.M. Dijkman and M. Dumas and L. Garc{\'i}a-Ba{\~n}uelos",
year = "2009",
doi = "10.1007/978-3-642-03848-8_5",
language = "English",
isbn = "978-3-642-03848-8",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "48--63",
editor = "U. Dayal and J. Eder and J. Koehler and H.A. Reijers",
booktitle = "Business process management : 7th international conference, BPM 2009, Ulm, Germany, September 8-10, 2009 : proceedings",
address = "Germany",
note = "7th International Conference on Business Process Management (BPM 2009), September 8-10, 2009, Ulm, Germany, BPM 2009 ; Conference date: 08-09-2009 Through 10-09-2009",
}