Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Median graph: a new exact algorithm using a distance based on the maximum common subgraph

Autor
Ferrer, M.; Valveny, E.; Serratosa, F.
Tipus d'activitat
Article en revista
Revista
Pattern recognition letters
Data de publicació
2009
Volum
30
Número
5
Pàgina inicial
579
Pàgina final
588
DOI
https://doi.org/10.1016/j.patrec.2008.12.014 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/19184 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0167865509000026 Obrir en finestra nova
Resum
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...
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.
Grup de recerca
VIS - Visió Artificial i Sistemes Intel.ligents

Participants

  • Ferrer Sumsi, Miquel  (autor)
  • Valveny Llobet, Ernest  (autor)
  • Serratosa Casanelles, Francesc  (autor)