Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | |
| Published: |
Zenodo
2026
|
| Online Access: | https://doi.org/10.5281/zenodo.18856425 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- <p dir="auto"><strong>OrbitSI</strong> is a NetworkX-based Python package that efficiently solves the <strong>subgraph isomorphism enumeration problem</strong>, i.e., finding all subgraphs in a large data graph <em>G</em><sub>d</sub> that are isomorphic to a pattern/query graph <em>G</em><sub>p</sub>. It also supports fast vertex orbit counting, which summarises the local structural roles of vertices within a network.</p> <p dir="auto">OrbitSI combines orbit-based filtering and ordering to prune and order candidate node mappings, significantly reducing the search space during subgraph matching. It integrates two state-of-the-art orbit counting engines — <strong>EVOKE</strong> and <strong>ORCA</strong> — via optimised C++ bindings using <code>pybind11</code>, and builds the search pipeline using <code>networkx</code>.</p> <p dir="auto">The package includes a command-line interface (CLI), usable library, and testing utilities. It is installable via <code>pip</code>, tested on synthetic and real-world benchmark datasets, and fully open source under the Apache 2.0 license.</p>