Skip to main content

On Graphs with Unique Node Labels

  • Conference paper
  • First Online:
Graph Based Representations in Pattern Recognition (GbRPR 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2726))


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

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. IEEE Trans. PAMI, Special Section on Graph Algorithms and Computer Vision, Vol. 23(10), 2001, 1049–1151

    Google Scholar 

  2. Pattern Recognition Letters, Special Issue on Graph Based Representation, 2003, to appear

    Google Scholar 

  3. McKay, B.D.: Practical Graph Isomorphism, Congressus Numerantium, Vol. 30, 1981, 45–87

    MathSciNet  Google Scholar 

  4. Ullman, J.R.: An algorihm for subgraph isomorphism, Journal of the ACM, Vol. 23(1), 1976, 31–42

    Article  MATH  Google Scholar 

  5. McGregor, J.: Backtrack search algorithms and the maximal common subgraph problem, Software-Practice and Experience, Vol. 12, 1982, 23–13

    Article  MATH  Google Scholar 

  6. Levi, G.: A note on the derivation of maximal common subgraphs of two directed or undirected graphs, Calcolo 9, 1972, 341–354

    Google Scholar 

  7. Sanfeliu, A., Fu, K.S.: A Distance Measure Between Attributed Relational Graphs for Pattern Recognition, IEEE Trans. SMC, Vol. 13(3), 1983, 353–363

    MATH  Google Scholar 

  8. Messmer, B.T., Bunke, H.: A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection, IEEE Trans. PAMI, Vol. 20(5), 1998, 493–507

    Google Scholar 

  9. 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

    Google Scholar 

  10. Larrosa, J., Valiente, G.: Constraint satisfaction algorithms for graph pattern matching, Math. Struct. in Computer Science, Vol. 12, 2002, 403–422

    Article  MATH  MathSciNet  Google Scholar 

  11. Christmas, W.J., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation, IEEE Trans. PAMI, Vol. 17(8), 1995, 749–764

    Google Scholar 

  12. 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

    Google Scholar 

  13. 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

    Google Scholar 

  14. 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

    Article  MATH  MathSciNet  Google Scholar 

  15. Pelillo, M.: Matching Free Trees, Maximal Cliques and Monotone Game Dynamics, IEEE Trans. PAMI, Vol. 24(11), 2002, 1535–1541

    Google Scholar 

  16. 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

    Google Scholar 

  17. Bunke, H.: Error correcting graph matching: on the influence of the underlying cost function, IEEE Trans. PAMI, Vol. 21, 1999, 917–922

    Google Scholar 

  18. 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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints 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.

Download citation

  • DOI:

  • 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

Publish with us

Policies and ethics