On graphs with unique node labels

Authors:
Peter J. Dickinson;Horst Bunke;Arek Dadej;Miro Kraetzl
Affiliations:
ISR Division, DSTO, Edinburgh, SA, Australia;Institut für Informatik und angewandte Mathematik, Universität Bern, Neubrückstrasse, Bern, Switzerland;ITR, University of South Australia, Mawson Lakes, SA, Australia;ISR Division, DSTO, Edinburgh, SA, Australia
Venue:
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Year:
2003

Citing 10
Cited 8

A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
Introduction to the Special Section on Graph Algorithms in Computer Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Structural Matching in Computer Vision Using Probabilistic Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics

IEEE Transactions on Pattern Analysis and Machine Intelligence
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Classification of Web Documents Using a Graph Model

ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 1
Constraint satisfaction algorithms for graph pattern matching

Mathematical Structures in Computer Science
Genetic-based search for error-correcting graph isomorphism

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Adaptivity at every layer: a modular approach for evolving societies of learning autonomous systems

Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems
Approximate graph edit distance computation by means of bipartite graph matching

Image and Vision Computing
Learning patterns in the dynamics of biological networks

Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph-based tools for data mining and machine learning

MLDM'03 Proceedings of the 3rd international conference on Machine learning and data mining in pattern recognition
Graph based shapes representation and recognition

GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Fast suboptimal algorithms for the computation of graph edit distance

SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Recovery of missing information in graph sequences

GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
How to search in MPEG-7 based semantic descriptions: an evaluation of metrics

Multimedia Tools and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.