Stigmergic Swarming Agents for Fast Subgraph Isomorphism
arXiv:2601.02449v1 Announce Type: new Abstract: Maximum partial subgraph isomorphism compares two graphs (nodes joined by edges) to find a largest common subgraph. A common use case, for graphs with labeled nodes, seeks to find instances of a textit{query} graph with $q$ nodes in a (typically larger) textit{data} graph with $d$ nodes. The problem is NP-complete, and na”ive solutions are exponential in $q + d$. The fastest current heuristic has complexity $O(d^2)$. This paper outlines ASSIST (Approximate Swarming Subgraph […]