{"id":17127786,"url":"https://github.com/nosarthur/subgraph","last_synced_at":"2025-07-02T17:02:36.058Z","repository":{"id":112675371,"uuid":"120568533","full_name":"nosarthur/subgraph","owner":"nosarthur","description":"subgraph isomorphism","archived":false,"fork":false,"pushed_at":"2019-02-27T13:08:29.000Z","size":6,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-24T04:17:58.331Z","etag":null,"topics":["algorithm","golang","graph-algorithms","graph-theory","subgraph"],"latest_commit_sha":null,"homepage":null,"language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/nosarthur.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-02-07T05:40:02.000Z","updated_at":"2024-08-04T03:36:29.000Z","dependencies_parsed_at":"2023-06-11T00:15:36.983Z","dependency_job_id":null,"html_url":"https://github.com/nosarthur/subgraph","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/nosarthur/subgraph","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nosarthur%2Fsubgraph","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nosarthur%2Fsubgraph/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nosarthur%2Fsubgraph/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nosarthur%2Fsubgraph/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nosarthur","download_url":"https://codeload.github.com/nosarthur/subgraph/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nosarthur%2Fsubgraph/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":263181949,"owners_count":23426619,"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":["algorithm","golang","graph-algorithms","graph-theory","subgraph"],"created_at":"2024-10-14T19:05:24.841Z","updated_at":"2025-07-02T17:02:36.001Z","avatar_url":"https://github.com/nosarthur.png","language":"Go","readme":"# subgraph\n\nTry variants of VF2 algorithm for subgraph isomorphism to test speed\n\n\n## subgraph isomorphism papers\n\n* VF: [C. Sansone L. P. Cordella, P. Foggia and M. Vento. Performance evaluation of the vf graph matching algorithm. Proc. of the 10th ICIAP, IEEE Computer Society Press, pp. 1172-1177, 1999.](http://ieeexplore.ieee.org/abstract/document/797762/)\n* VF2: [L.P. Cordella, P. Foggia, C. Sansone, and M. Vento. A (sub)graph isomorphism algorithm for matching large graphs. Journal of the ACM (JACM) JACM Homepage archive Volume 23 Issue 1, Pages 31-42, 2004.](https://pdfs.semanticscholar.org/b621/74dcbd30c690014c3bdd769a4a15b7e37839.pdf)\n* VF2 Plus: [Carletti V., Foggia P., Vento M. (2015) VF2 Plus: An Improved version of VF2 for Biological Graphs. In: Liu CL., Luo B., Kropatsch W., Cheng J. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2015. Lecture Notes in Computer Science, vol 9069. Springer, Cham](https://link.springer.com/chapter/10.1007/978-3-319-18224-7_17)\n* VF3: [Carletti V., Foggia P., Saggese A., Vento M. (2017) Introducing VF3: A New Algorithm for Subgraph Isomorphism. In: Foggia P., Liu CL., Vento M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2017. Lecture Notes in Computer Science, vol 10310. Springer, Cham](https://link.springer.com/chapter/10.1007/978-3-319-58961-9_12)\n\n## core ideas\n\n* branch and bound\n* pruning\n    * best found, current + potential\n    * consider only connected subgraphs\n    * other graph properties, e.g., chromatic number is an upper bound for max clique size\n* ordering\n\n## TODO\n* VF2\n* VF2+\n* VF2++\n\n## Resources\n- [Vincenzo Carletti's github account](https://github.com/vincarlet)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnosarthur%2Fsubgraph","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnosarthur%2Fsubgraph","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnosarthur%2Fsubgraph/lists"}