2 papers
cs.DS2026
Counting Patterns in Degenerate Graphs in Constant Space
Balagopal Komarath, Anant Kumar, Akash Pareek
For a fixed pattern graph, we study the algorithmic complexity of counting homomorphisms, subgraph isomorphisms, and induced subgraph isomorphisms into an -vertex, -degenerat…
cs.LG2025
Local Fragments, Global Gains: Subgraph Counting using Graph Neural Networks
Shubhajit Roy, Shrutimoy Das, Binita Maity +2
Subgraph counting is a fundamental task for analyzing structural patterns in graph-structured data, with important applications in domains such as computational biology and social…