Median graph: a new exact algorithm using a distance based on the maximum common subgraph
Visualitza/Obre
Median graph a new exact algorithm using a distance based (546,7Kb) (Accés restringit)
Sol·licita una còpia a l'autor
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
10.1016/j.patrec.2008.12.014
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/19184
Tipus de documentArticle
Data publicació2009
Condicions d'accésAccés restringit per política de l'editorial
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more efficient optimal algorithm for the median graph computation. With the use of a particular cost function that permits the definition of the graph edit distance in terms of the maximum common subgraph, and a prediction function in the backtracking algorithm, we reduce the size of the search space, avoiding the evaluation of a great amount of states and still obtaining the exact median. We present a set of experiments comparing our new algorithm against the previous existing exact algorithm using synthetic data. In addition, we present the first application of the exact median graph computation to real data and we compare the results against an approximate algorithm based on genetic search. These experimental results show that our algorithm outperforms the previous existing exact algorithm and in addition show the potential applicability of the exact solutions to real problems.
CitacióFerrer, M.; Valveny, E.; Serratosa, F. Median graph: a new exact algorithm using a distance based on the maximum common subgraph. "Pattern recognition letters", 2009, vol. 30, núm. 5, p. 579-588.
ISSN0167-8655
Versió de l'editorhttp://www.sciencedirect.com/science/article/pii/S0167865509000026
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Median graph a ... using a distance based.pdf | Median graph a new exact algorithm using a distance based | 546,7Kb | Accés restringit |