Algorithms for approximate graph matching

Labeled graphs are graphs in which each node and edge has a label. The distance between two labeled graphs is considered to be the weighted sum of the costs of edit operations (insert, delete, and relabel the nodes and edges) to transform one graph to the other. The paper considers two variants of t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information sciences 1995, Vol.82 (1), p.45-74
Hauptverfasser:	Wang, Jason T.L., Zhang, Kaizhong, Chirn, Gung-Wei
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Artificial intelligence Computer science control theory systems Exact sciences and technology Information retrieval. Graph Pattern recognition. Digital image processing. Computational geometry Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!