https://github.com/nosarthur/subgraph

subgraph isomorphism
https://github.com/nosarthur/subgraph

algorithm golang graph-algorithms graph-theory subgraph

Last synced: 12 days ago
JSON representation

subgraph isomorphism

• Host: GitHub
• URL: https://github.com/nosarthur/subgraph
• Owner: nosarthur
• License: mit
• Created: 2018-02-07T05:40:02.000Z (about 7 years ago)
• Default Branch: master
• Last Pushed: 2019-02-27T13:08:29.000Z (almost 6 years ago)
• Last Synced: 2024-12-01T09:47:26.250Z (2 months ago)
• Topics: algorithm, golang, graph-algorithms, graph-theory, subgraph
• Language: Go
• Size: 5.86 KB
• Stars: 2
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# subgraph

Try variants of VF2 algorithm for subgraph isomorphism to test speed

## subgraph isomorphism papers

* 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/)

* 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)

* 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)

* 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)

## core ideas

* branch and bound

* pruning

    * best found, current + potential

    * consider only connected subgraphs

    * other graph properties, e.g., chromatic number is an upper bound for max clique size

* ordering

## TODO

* VF2

* VF2+

* VF2++

## Resources

- [Vincenzo Carletti's github account](https://github.com/vincarlet)