{"id":19694138,"url":"https://github.com/innofang/subgraph-isomorphism","last_synced_at":"2025-04-29T10:30:47.782Z","repository":{"id":41428940,"uuid":"164308818","full_name":"InnoFang/subgraph-isomorphism","owner":"InnoFang","description":"❄Implement the common subgraph isomorphism algorithms (i.e. Ullmann, VF2) based on MapReduce on Hadoop ","archived":false,"fork":false,"pushed_at":"2022-07-01T17:42:02.000Z","size":20504,"stargazers_count":19,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-05T14:51:13.961Z","etag":null,"topics":["isomorphism","mapreduce","mapreduce-algorithm","subgraph-count","subgraph-isomorphism","ullmann","ullmann-algorithm","vf2","vf2-algorithm"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/InnoFang.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2019-01-06T13:17:12.000Z","updated_at":"2025-03-09T14:57:06.000Z","dependencies_parsed_at":"2022-08-25T06:20:38.302Z","dependency_job_id":null,"html_url":"https://github.com/InnoFang/subgraph-isomorphism","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/InnoFang%2Fsubgraph-isomorphism","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/InnoFang%2Fsubgraph-isomorphism/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/InnoFang%2Fsubgraph-isomorphism/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/InnoFang%2Fsubgraph-isomorphism/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/InnoFang","download_url":"https://codeload.github.com/InnoFang/subgraph-isomorphism/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":251483656,"owners_count":21596577,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["isomorphism","mapreduce","mapreduce-algorithm","subgraph-count","subgraph-isomorphism","ullmann","ullmann-algorithm","vf2","vf2-algorithm"],"created_at":"2024-11-11T19:20:32.719Z","updated_at":"2025-04-29T10:30:46.220Z","avatar_url":"https://github.com/InnoFang.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Subgraph Isomorphism\n\n❄Implement the common subgraph isomorphism algorithms (i.e. Ullmann, VF2) based on `MapReduce` on `Hadoop`. \n\nMore information, please see [wiki](https://github.com/InnoFang/subgraph-isomorphism/wiki)\n\nMore usage, please see test cases:\n + [GraphReaderTest](https://github.com/InnoFang/subgraph-isomorphism/blob/master/src/test/java/io/github/innofang/graph/GraphReaderTest.java)\n + [UllmannTest](https://github.com/InnoFang/subgraph-isomorphism/blob/master/src/test/java/io/github/innofang/lib/UllmannTest.java)\n + [VF2Test](https://github.com/InnoFang/subgraph-isomorphism/blob/master/src/test/java/io/github/innofang/lib/VF2Test.java)\n\n[Download](https://github.com/InnoFang/subgraph-isomorphism/releases) jar files for a try!\n\n## What's subgraph isomorphism problem?\n\nIn theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G and H are given as input, and one must determine whether G contains a subgraph that is isomorphic to H.\n\n## the UML of Implementation of SubGraph Isomorphism Algorithms\n\n the encapsulation and optimization of the Ullmann algorithm and the VF2 algorithm are carried out. The UML as follow:\n\n![](https://cdn.jsdelivr.net/gh/innofang/jotter/source/subgraph-isomorphism/the%20UML%20of%20Implementation%20of%20Subgraph%20Isomorphism%20Algorithms.png)\n\n## Flow Diagram of the MapReduce Process\n\n![](https://cdn.jsdelivr.net/gh/innofang/jotter/source/subgraph-isomorphism/Flow%20Diagram%20of%20the%20MapReduce%20Process.jpg)\n\n\n## Reference \u0026 Bibliography\n\n + Wikipedia contributors. (2018, October 13). Subgraph isomorphism problem. In Wikipedia, The Free Encyclopedia. Retrieved 09:12, April 8, 2019, from https://en.wikipedia.org/w/index.php?title=Subgraph_isomorphism_problem\u0026oldid=863918223\n\n + Ullmann J R. An algorithm for subgraph isomorphism[J]. Journal of the ACM (JACM), 1976, 23(1): 31-42. [link](https://www.cs.bgu.ac.il/~dinitz/Course/SS-12/Ullman_Algorithm.pdf)\n\n + Cordella L P, Foggia P and Sansone C. A (sub)graph isomorphism algorithm for matching large graphs[J]. IEEE PAMI, 2004, 26(10):1367–1372. [link](https://ieeexplore.ieee.org/document/1323804?arnumber=1323804\u0026tag=1)\n\n + Ashish Sharma, Santosh Bahir, Sushant Narsale, Unmil Tambe, \"A  Parallel Algorithm for Finding Sub-graph Isomorphism\", CS420-ProjectReport  (www.cs.jhu.edu/~snarsal/CS420-ProjectReport.pdf), CS420: Parallel Programming. Fall 2008.\n\n## [License](./LICENSE)\n\n    Subgraph Isomorphism: Implement the common subgraph isomorphism algorithms (i.e. Ullmann, VF2) based on MapReduce on Hadoop \n    Copyright (C) 2019  InnoFang\n\n    This program is free software: you can redistribute it and/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation, either version 3 of the License, or\n    (at your option) any later version.\n\n    This program is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License\n    along with this program.  If not, see \u003chttp://www.gnu.org/licenses/\u003e.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Finnofang%2Fsubgraph-isomorphism","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Finnofang%2Fsubgraph-isomorphism","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Finnofang%2Fsubgraph-isomorphism/lists"}