research-article

A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs

Authors:

Luigi P. Cordella,

Pasquale Foggia,

Mario VentoAuthors Info & Claims

IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume 26, Issue 10

Pages 1367 - 1372

https://doi.org/10.1109/TPAMI.2004.75

Published: 01 October 2004 Publication History

Abstract

We present an algorithm for graph isomorphism and subgraph isomorphism suited for dealing with large graphs. A first version of the algorithm has been presented in a previous paper, where we examined its performance for the isomorphism of small and medium size graphs. The algorithm is improved here to reduce its spatial complexity and to achieve a better performance on large graphs; its features are analyzed in detail with special reference to time and memory requirements. The results of a testing performed on a publicly available database of synthetically generated graphs and on graphs relative to a real application dealing with technical drawings are presented, confirming the effectiveness of the approach, especially when working with large graphs.

References

[1]

I. Rocha and T. Pavlidis, “A Shape Analysis Model with Application to a Character Recognition System,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, pp. 393-404, 1994.

Digital Library

[2]

L.G. Shapiro and R.M. Haralick, “Structural Description and Inexact Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, no. 3, pp.nbsp505-519, 1981.

[3]

L.P. Cordella and M. Vento, “Symbol Recognition in Documents: A Collection of Techniques?” Int'l J. Document Analysis and Recognition, vol. 3, pp. 73-88, 2000.

[4]

L. Jianzhuang and L.Y. Tsui, “Graph-Based Method for Face Identification from a Single 2D Line Drawing,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1106-1119, 2001.

Digital Library

[5]

J. Llados E. Marti and J.J. Villanueva, “Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1137-1143, 2001.

Digital Library

[6]

D. Conte P. Foggia C. Sansone and M. Vento, “Thirty Years of Graph Matching in Pattern Recognition,” Int'l J. Pattern Recognition and Artificial Intelligence, vol. 18, no. 3, pp. 265-298, 2004.

[7]

L.P. Cordella P. Foggia C. Sansone and M. Vento, “Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs,” Computing, vol. 12, pp. 43-52, 1998.

[8]

W.H. Tsai and K.S. Fu, “Subgraph Error-Correcting Isomorphisms for Syntactic Pattern Recognition,” IEEE Trans. Systems, Man, and Cybernetics, vol. 13, pp. 48-62, 1983.

[9]

L.G. Shapiro and R.M. Haralick, “A Metric for Comparing Relational Descriptions,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, pp. 90-94, 1985.

Digital Library

[10]

E.M. Luks, “Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time,” J. Computer System Science, pp. 42-65, 1982.

[11]

J.R. Ullmann, “An Algorithm for Subgraph Isomorphism,” J. Assoc. for Computing Machinery, vol. 23, pp. 31-42, 1976.

Digital Library

[12]

B.T. Messmer, “Efficient Graph Matching Algorithms for Preprocessed Model Graphs,” PhD Thesis, Inst. of Computer Science and Applied Mathematics, Univ. of Bern, 1996.

[13]

B.D. McKay, “Practical Graph Isomorphism,” Congressus Numerantium, vol. 30, pp. 45-87, 1981.

[14]

H. Bunke and B.T. Messmer, “Efficient Attributed Graph Matching and Its Application to Image Analysis,” Proc. Image Analysis and Processing, pp. 45-55, 1995.

Digital Library

[15]

W.J. Christmas J. Kittler and M. Petrou, “Structural Matching in Computer Vision Using Probabilistic Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749-764, 1995.

Digital Library

[16]

L.P. Cordella P. Foggia C. Sansone and M. Vento, “Evaluating Performance of the VF Graph Matching Algorithm,” Proc. 10th Int'l Conf. Image Analysis and Processing, pp. 1172-1177, Sept. 1999.

Digital Library

[17]

P. Foggia C. Sansone and M. Vento, “A Database of Graphs for Isomorphism and Sub Graph Isomorphism Benchmarking,” Proc. Third IAPR TC-15 Int'l Workshop Graph Based Representations, pp. 176-188, 2001.

[18]

N.J. Nilsson, Principles of Artificial Intelligence. Springer-Verlag, 1982.

Digital Library

[19]

B.T. Messmer and H. Bunke, “A Decision Tree Approach to Graph and Subgraph Isomorphism Detection,” Pattern Recognition, vol. 32, pp. 1979-1998, 1999.

[20]

M. Burge and W.G. Kropatsch, “A Minimal Line Property Preserving Representation for Line Images,” Computing, vol. 62, no. 4, pp. 355-368, 1999.

Digital Library

Cited By

Yang JFang SGu ZMa ZLin XTian Z(2024)TC-Match: Fast Time-Constrained Continuous Subgraph MatchingProceedings of the VLDB Endowment10.14778/3681954.368196317:11(2791-2804)Online publication date: 30-Aug-2024
https://doi.org/10.14778/3681954.3681963
Li QYu J(2024)Fast Local Subgraph CountingProceedings of the VLDB Endowment10.14778/3659437.365945117:8(1967-1980)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.14778/3659437.3659451
Shin WSong SPark KHan W(2024)Cardinality Estimation of Subgraph Matching: A Filtering-Sampling ApproachProceedings of the VLDB Endowment10.14778/3654621.365463517:7(1697-1709)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.14778/3654621.3654635
Show More Cited By

Index Terms

A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
1. Applied computing
  1. Physical sciences and engineering
    1. Mathematics and statistics
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms

Recommendations

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

This paper deals with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chordal graphs. It is known that GI problem is GI complete even for some special graph classes including regular graphs, bipartite ...
On large (Δ, D, D, 1)-graphs

Concern about fault tolerance in the design of interconnection networks has aroused interest in finding large graphs such that the subgraphs obtained by deleting any set of up to s vertices have small diameter. Clearly, 1 ≤ s ≤ Δ − 1, where Δ is the ...
A new distributed graph coloring algorithm for large graphs
Abstract
The vertex graph coloring problem (VGCP) is one of the most well-known problems in graph theory. It is used for solving several real-world problems such as compiler optimization, map coloring, and frequency assignment. The goal of VGCP is to color ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Pattern Analysis and Machine Intelligence

IEEE Transactions on Pattern Analysis and Machine Intelligence Volume 26, Issue 10

October 2004

144 pages

ISSN:0162-8828

Issue’s Table of Contents

Copyright © 2004.

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 October 2004

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

384
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Yang JFang SGu ZMa ZLin XTian Z(2024)TC-Match: Fast Time-Constrained Continuous Subgraph MatchingProceedings of the VLDB Endowment10.14778/3681954.368196317:11(2791-2804)Online publication date: 30-Aug-2024
https://doi.org/10.14778/3681954.3681963
Li QYu J(2024)Fast Local Subgraph CountingProceedings of the VLDB Endowment10.14778/3659437.365945117:8(1967-1980)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.14778/3659437.3659451
Shin WSong SPark KHan W(2024)Cardinality Estimation of Subgraph Matching: A Filtering-Sampling ApproachProceedings of the VLDB Endowment10.14778/3654621.365463517:7(1697-1709)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.14778/3654621.3654635
Ye YLian XChen M(2024)Efficient Exact Subgraph Matching via GNN-Based Path Dominance EmbeddingProceedings of the VLDB Endowment10.14778/3654621.365463017:7(1628-1641)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.14778/3654621.3654630
Sharma AMehta DWu B(2024)Understanding High-Performance Subgraph Pattern Matching: A Systems PerspectiveProceedings of the 7th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)10.1145/3661304.3661897(1-12)Online publication date: 14-Jun-2024
https://dl.acm.org/doi/10.1145/3661304.3661897
Chen SCai CZheng SLi JZhu GLi JYan YDai YYin WWang L(2024)HierCGRA: A Novel Framework for Large-scale CGRA with Hierarchical Modeling and Automated Design Space ExplorationACM Transactions on Reconfigurable Technology and Systems10.1145/365617617:2(1-31)Online publication date: 8-Apr-2024
https://dl.acm.org/doi/10.1145/3656176
Kegel KDomanowski AFeichtinger KPascual RAßmann UCombemale BWimmer MChechik MEgyed A(2024)A Delta-Oracle for Fast Model Merge Conflict Estimation using Sketch-Based Critical Pair AnalysisProceedings of the ACM/IEEE 27th International Conference on Model Driven Engineering Languages and Systems10.1145/3652620.3688341(1046-1055)Online publication date: 22-Sep-2024
https://dl.acm.org/doi/10.1145/3652620.3688341
Liu SLan JDu XLi JLu WJiang JDu XChristakis MPradel M(2024)Testing Graph Database Systems with Graph-State Persistence OracleProceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3650212.3680311(666-677)Online publication date: 11-Sep-2024
https://dl.acm.org/doi/10.1145/3650212.3680311
Wu JSha JBilal MZhang YXu X(2024)Diverse Top-k Service Composition for Consumer Electronics With Digital Twin in MECIEEE Transactions on Consumer Electronics10.1109/TCE.2024.335760970:1(3183-3193)Online publication date: 23-Jan-2024
https://dl.acm.org/doi/10.1109/TCE.2024.3357609
Panahandeh MHamou-Lhadj AHamdaqa MMiller J(2024)ServiceAnomalyJournal of Systems and Software10.1016/j.jss.2023.111917209:COnline publication date: 14-Mar-2024
https://dl.acm.org/doi/10.1016/j.jss.2023.111917
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents