OrbitSI is an open-source Python framework designed to efficiently solve the subgraph isomorphism enumeration problem, i.e., identifying all subgraphs within a data graph that are structurally identical to a given pattern graph. The tool introduces an orbit-aware pruning and ordering strategy that significantly improves enumeration speed compared to classical algorithms. […]
Subgraph Isomorphism
5 posts
I recently travelled to Marrakech, Morocco, to present my research at the 9th International Conference on Metaheuristics and Nature-Inspired Computing (META 2023). Held from November 1–4, 2023, the conference provided an incredible atmosphere for discussing how meta-heuristics can tackle complex optimisation problems. My paper, “Machine learning-based per-instance algorithm selection for […]
I presented a poster on “Graphlet-based Filtering for High-Performance Subgraph Isomorphism Search” at the 19th International Summer School on Advanced Computer Architecture and Compilation for High-performance Embedded Systems organised by HiPEAC at Fiuggi, Italy between July 9 – 15, 2023. Summary Introduction Graphs are powerful tools for representing complex relationships […]
This submission won the first prize in the ‘Faculty of Engineering and Physical Sciences’ category at the ‘Research Culture Poster Competition’ organised by the Graduate School, Queen’s University Belfast in 2021. Two seemingly unrelated fields – biomedical research and road planning – have found common ground through subgraph isomorphism search. […]
In this post, I’ll be introducing the core aspects of my research, discussing the significance of subgraph isomorphism search in graphs, and outlining the objectives and milestones that lay ahead for me in my PhD journey. As you may know, graphs are a fundamental structure in computer science, finding applications […]