2005 | OriginalPaper | Buchkapitel
From Exact to Approximate Maximum Common Subgraph
verfasst von : Simone Marini, Michela Spagnuolo, Bianca Falcidieno
Erschienen in: Graph-Based Representations in Pattern Recognition
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper presents an algorithm for the computation of the maximum common subgraph (MCS) between two directed, acyclic graphs with attributes. The core of the contribution resides in the modularity of the proposed algorithm which allows different heuristic techniques to be plugged in, depending on the application domain. Implemented heuristics for robust graph matching with respect to graph structural noise are discussed.
As example of its effectiveness, the algorithm is applied to the problem of 3D shape similarity evaluation through structural shape descriptors.