Anzeige
Erschienen in:
2003 | OriginalPaper | Buchkapitel
On Graphs with Unique Node Labels
verfasst von : Peter J. Dickinson, Horst Bunke, Arek Dadej, Miro Kraetzl
Erschienen in: Graph Based Representations in Pattern Recognition
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
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
A special class of graphs is introduced in this paper. The graphs belonging to this class are characterised by the existence of unique node labels. A number of matching algorithms for graphs with unique node labels are developed. It is shown that problems such as graph isomorphism, subgraph isomorphism, maximum common subgraph and others have a computational complexity that is only quadratic in the number of nodes. We also discuss some potential applications of the considered class of graphs.