Median graphs: A genetic approach based on new theoretical properties

Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present two major co...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Pattern recognition Jg. 42; H. 9; S. 2003 - 2012
Hauptverfasser:	Ferrer, M., Valveny, E., Serratosa, F.
Format:	Journal Article Verlag
Sprache:	Englisch
Veröffentlicht:	Kidlington Elsevier Ltd 01.09.2009 Elsevier
Schlagworte:	Algorismes computacionals Algorismes genètics Algorithms and architectures for advanced scientific computing Algorísmica i teoria de la complexitat Anàlisi numèrica Applied sciences Computer algorithms Exact sciences and technology Genetic search Graph matching Information, signal and communications theory Informàtica Informàtica teòrica Matemàtiques i estadística Maximum common subgraph Median graph Modelització matemàtica Pattern recognition Processament de dades Signal processing Structural pattern recognition Telecommunications and information theory Àrees temàtiques de la UPC Genetic search Maximum common subgraph Structural pattern recognition Median graph Graph matching Subgraph Pattern recognition Algorithm Computational complexity
ISSN:	0031-3203, 1873-5142
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!