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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
IEEE Trans. PAMI, Special Section on Graph Algorithms and Computer Vision, Vol. 23(10), 2001, 1049–1151
Pattern Recognition Letters, Special Issue on Graph Based Representation, 2003, to appear
McKay, B.D.: Practical Graph Isomorphism, Congressus Numerantium, Vol. 30, 1981, 45–87
Ullman, J.R.: An algorihm for subgraph isomorphism, Journal of the ACM, Vol. 23(1), 1976, 31–42
McGregor, J.: Backtrack search algorithms and the maximal common subgraph problem, Software-Practice and Experience, Vol. 12, 1982, 23–13
Levi, G.: A note on the derivation of maximal common subgraphs of two directed or undirected graphs, Calcolo 9, 1972, 341–354
Sanfeliu, A., Fu, K.S.: A Distance Measure Between Attributed Relational Graphs for Pattern Recognition, IEEE Trans. SMC, Vol. 13(3), 1983, 353–363
Messmer, B.T., Bunke, H.: A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection, IEEE Trans. PAMI, Vol. 20(5), 1998, 493–507
Cordella, L.P., Foggia, P., Sansome, C., Vento, M.: An Improved Algorithm for Matching Large Graphs, Proceedings of the 3rd IAPR-TC15 Workshop on Graphbased Representations in Pattern Recognition, 2001, 149–159
Larrosa, J., Valiente, G.: Constraint satisfaction algorithms for graph pattern matching, Math. Struct. in Computer Science, Vol. 12, 2002, 403–422
Christmas, W.J., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation, IEEE Trans. PAMI, Vol. 17(8), 1995, 749–764
Wang, I., Fan, K-C., Horng, J-T.: Genetic-based search for error-correcting graph isomorphism, IEEE Trans. SMC, Vol. 27(4), 1997, 588–597
Hopcroft, J. E., Wong, J.: Linear time algorithm for isomorphism of planar graphs, Proceedings of the 6th Annual ACM Symposium on Theory of Computing, 1974, 172–184
Luks, E.M.: Isomorphism of Graphs of Bounded Valence Can Be Tested In Polynomial Time, Journal of Computer and Systems Sciences, Vol. 25, 1982, 42–65
Pelillo, M.: Matching Free Trees, Maximal Cliques and Monotone Game Dynamics, IEEE Trans. PAMI, Vol. 24(11), 2002, 1535–1541
Schenker, A., Last, M., Bunke, H., Kandel, A.: Clustering of web documents using a graph model, In Antonacopoulos, A., Hu, Jianying (eds), Web Document Analysis: Challenges and Opportunities, World Scientific, 2003, to appear
Bunke, H.: Error correcting graph matching: on the influence of the underlying cost function, IEEE Trans. PAMI, Vol. 21, 1999, 917–922
Shoubridge, P.J., Kraetzl, M., Wallis, W.D., Bunke, H.: Abnormal Change Detection of Abnormal Change in a Time Series of Graphs, Journal of Interconnection Networks, Vol. 3, 2002, 85–101
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dickinson, P.J., Bunke, H., Dadej, A., Kraetzl, M. (2003). On Graphs with Unique Node Labels. In: Hancock, E., Vento, M. (eds) Graph Based Representations in Pattern Recognition. GbRPR 2003. Lecture Notes in Computer Science, vol 2726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45028-9_2
Download citation
DOI: https://doi.org/10.1007/3-540-45028-9_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40452-1
Online ISBN: 978-3-540-45028-3
eBook Packages: Springer Book Archive