Citing

If you use OrbitSI for subgraph isomorphism search, please cite:

Syed Ibtisam Tauhidi, Arindam Karmakar, Thai Son Mai and Hans Vandierendonck. “OrbitSI: An Orbit-based Algorithm for the Subgraph Isomorphism Search Problem.” In 2024 IEEE International Conference on Knowledge Graph (ICKG), pp. 360-369. IEEE, 2024. doi:10.1109/ICKG63256.2024.00052

If you use only the orbit counters, cite the engine:

• EVOKE: Noujan Pashanasangi and C. Seshadhri. “Efficiently counting vertex orbits of all 5-vertex subgraphs, by EVOKE.” WSDM 2020, pp. 447-455. doi:10.1145/3336191.3371773

• ORCA: Tomaž Hočevar and Janez Demšar. “A combinatorial approach to graphlet counting.” Bioinformatics, 30(4): 559-565, 2014. doi:10.1093/bioinformatics/btt717

Acknowledgement

This work was supported by the Kelvin Living Lab [grant number EP/Z531054/1] and by the Ministry of Education, Government of India, through the collaboration between Queen’s University Belfast and Tezpur University.

License

OrbitSI is licensed under the Apache License 2.0.