The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
An Algorithm for Subgraph Isomorphism
Open accessAbstract
Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph isomorphism, clique detection, graph isomorphism, and directed graph isomorphism experiments have been carried out with random and with various nonrandom graphs. A parallel asynchronous logic-in-memory implementation of a vital part of the algorithm is also described, although this hardware has not actually been built. The hardware implementation would allow very rapid determination of isomorphism.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Harary, F. (1969) · Cited by 10,739
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
Algorithm 457: finding all cliques of an undirected graph
Bron, C., & Kerbosch, J. (1973) · Communications of the ACM · doi:10.1145/362342.362367 · Cited by 2,452
Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub.
Bledsoe, W. W. (1971) · ACM SIGART Bulletin · doi:10.1145/1056578.1056583 · Cited by 356
An Efficient Algorithm for Graph Isomorphism
Corneil, D. G., & Gotlieb, C. C. (1970) · Journal of the ACM · doi:10.1145/321556.321562 · Cited by 334
Cited by
Kohler, E., Morris, R., Chen, B., Jannotti, J., & Kaashoek, M. F. (2000) · ACM Transactions on Computer Systems · doi:10.1145/354871.354874 · Cited by 2,413
Graph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
“The underlying idea is that two graphs are similar if they are isomorphic (Pelillo 1999), or one is isomorphic to a subgraph of the other (Chartrand et al. 1998; Ullmann 1976), or they have isomorphic subgraphs.”
BackgroundHandbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
A (sub)graph isomorphism algorithm for matching large graphs
Cordella, L. P., Foggia, P., Sansone, C., & Vento, M. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.75 · Cited by 1,477
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
CONTE, D., FOGGIA, P., SANSONE, C., & VENTO, M. (2004) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001404003228 · Cited by 1,370
Kuramochi, M., & Karypis, G. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989534 · Cited by 1,068
Pharmacophore modeling and applications in drug discovery: challenges and recent advances
Yang, S.-Y. (2010) · Drug Discovery Today · doi:10.1016/j.drudis.2010.03.013 · Cited by 901
A new Voronoi-based surface reconstruction algorithm
Amenta, N., Bern, M., & Kamvysselis, M. (1998) · Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98 · doi:10.1145/280814.280947 · Cited by 901
Historical review of OCR research and development
Mori, S., Suen, C. Y., & Yamamoto, K. (1992) · Proceedings of the IEEE · doi:10.1109/5.156468 · Cited by 892
Algorithms for constraint-satisfaction problems: a survey
Kumar, V. (1992) · doi:10.1609/aimag.v13i1.976 · Cited by 874
A graph distance metric based on the maximal common subgraph
Bunke, H., & Shearer, K. (1998) · Pattern Recognition Letters · doi:10.1016/s0167-8655(97)00179-7 · Cited by 754
Managing and Mining Graph Data
(2010) · Advances in Database Systems · doi:10.1007/978-1-4419-6045-0 · Cited by 594
Computational Analysis Methods in Atomistic Modeling of Crystals
Stukowski, A. (2014) · JOM · doi:10.1007/s11837-013-0827-5 · Cited by 575
Structural Descriptions and Inexact Matching
Shapiro, L. G., & Haralick, R. M. (1981) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1981.4767144 · Cited by 544
Synthesizing constraint expressions
Freuder, E. C. (1978) · Communications of the ACM · doi:10.1145/359642.359654 · Cited by 538
On a relation between graph edit distance and maximum common subgraph
Bunke, H. (1997) · Pattern Recognition Letters · doi:10.1016/s0167-8655(97)00060-3 · Cited by 530
PotentialNet for Molecular Property Prediction
Feinberg, E. N., Sur, D., Wu, Z., Husic, B. E., Mai, H., Li, Y., Sun, S., Yang, J., Ramsundar, B., & Pande, V. S. (2018) · ACS Central Science · doi:10.1021/acscentsci.8b00507 · Cited by 481
Rule-Based Modeling of Biochemical Systems with BioNetGen
Faeder, J. R., Blinov, M. L., & Hlavacek, W. S. (2009) · Methods in Molecular Biology · doi:10.1007/978-1-59745-525-1_5 · Cited by 425
Maximum common subgraph isomorphism algorithms for the matching of chemical structures
Raymond, J. W., & Willett, P. (2002) · Journal of Computer-Aided Molecular Design · doi:10.1023/a:1021271615909 · Cited by 424
GPLAG: detection of software plagiarism by program dependence graph analysis
Liu, C., Chen, C., Han, J., & Yu, P. S. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150522 · Cited by 422
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Shang, H., Zhang, Y., Lin, X., & Yu, J. X. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453899 · Cited by 401
Algorithmics and applications of tree and graph searching
Shasha, D., Wang, J. T. L., & Giugno, R. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543620 · Cited by 387
A Path Following Algorithm for the Graph Matching Problem
Zaslavskiy, M., Bach, F., & Vert, J.-P. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.245 · Cited by 385
Computational approaches for detecting protein complexes from protein interaction networks: a survey
Li, X., Wu, M., Kwoh, C.-K., & Ng, S.-K. (2010) · BMC Genomics · doi:10.1186/1471-2164-11-s1-s3 · Cited by 349
A survey of frequent subgraph mining algorithms
Jiang, C., Coenen, F., & Zito, M. (2013) · The Knowledge Engineering Review · doi:10.1017/s0269888912000331 · Cited by 346
Structural graph matching using the EM algorithm and singular value decomposition
Luo, B., & Hancock, E. R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.954602 · Cited by 345
A survey of community search over big graphs
Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., & Lin, X. (2020) · The VLDB Journal · doi:10.1007/s00778-019-00556-x · Cited by 339
Structure-Based Molecular Design
Kuntz, I. D., Meng, E. C., & Shoichet, B. K. (1994) · Accounts of Chemical Research · doi:10.1021/ar00041a001 · Cited by 328
(2010) · Chapman & Hall/CRC Data Mining and Knowledge Discovery Series · doi:10.1201/9781420091502-c15 · Cited by 328
Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
Tsai, W.-H., & Fu, K.-S. (1979) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1979.4310127 · Cited by 327
GraMi: frequent subgraph and pattern mining in a single large graph
Elseidy, M., Abdelhamid, E., Skiadopoulos, S., & Kalnis, P. (2014) · Proceedings of the VLDB Endowment · doi:10.14778/2732286.2732289 · Cited by 315
Huber, S. P., Zoupanos, S., Uhrin, M., Talirz, L., Kahle, L., Häuselmann, R., Gresch, D., Müller, T., Yakutovich, A. V., Andersen, C. W., et al. (2020) · Scientific Data · doi:10.1038/s41597-020-00638-4 · Cited by 314
Large-scale malware indexing using function-call graphs
Hu, X., Chiueh, T.-C., & Shin, K. G. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653736 · Cited by 312
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting
Bouritsas, G., Frasca, F., Zafeiriou, S., & Bronstein, M. M. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3154319 · Cited by 309
WITHDRAWN—a resource for withdrawn and discontinued drugs
Siramshetty, V. B., Nickel, J., Omieczynski, C., Gohlke, B.-O., Drwal, M. N., & Preissner, R. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkv1192 · Cited by 286
RetractedNetwork Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
Grochow, J. A., & Kellis, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71681-5_7 · Cited by 297
Backtrack search algorithms and the maximal common subgraph problem
McGregor, J. J. (1982) · Software: Practice and Experience · doi:10.1002/spe.4380120103 · Cited by 297
Closure-Tree: An Index Structure for Graph Queries
He, H., & Singh, A. K. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.37 · Cited by 293
Graph pattern matching: from intractable to polynomial time
Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., & Wu, Y. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920878 · Cited by 285
The Consistent Labeling Problem: Part I
Haralick, R. M., & Shapiro, L. G. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766903 · Cited by 285
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
Inokuchi, A., Washio, T., & Motoda, H. (2003) · Machine Learning · doi:10.1023/a:1021726221443 · Cited by 279
Recognition of Functional Sites in Protein Structures
Shulman-Peleg, A., Nussinov, R., & Wolfson, H. J. (2004) · Journal of Molecular Biology · doi:10.1016/j.jmb.2004.04.012 · Cited by 269
Fg-index: towards verification-free query processing on graph databases
Cheng, J., Ke, Y., Ng, W., & Lu, A. (2007) · Proceedings of the 2007 ACM SIGMOD international conference on Management of data · doi:10.1145/1247480.1247574 · Cited by 265
BinHunt: Automatically Finding Semantic Differences in Binary Programs
Gao, D., Reiter, M. K., & Song, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88625-9_16 · Cited by 255
Behavior based software theft detection
Wang, X., Jhi, Y.-C., Zhu, S., & Liu, P. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653696 · Cited by 101
Crafting Personalized Agents through Retrieval-Augmented Generation on Editable Memory Graphs
Wang, Z., Li, Z., Jiang, Z., Tu, D., & Shi, W. (2024) · Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2024.emnlp-main.281 · Cited by 12
Metadata
- Authors
- Ullmann, J. R.
- Venue
- Journal of the ACM
- Published
- 1976-01
- Volume
- 23
- Issue
- 1
- Pages
- 31-42
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2126359798
- Cited by
- 2,277
- References
- 5
- FWCI
- 14.70
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.