3 papers
cs.DS2025
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.LG2023
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…
cs.DS2023
The Isomorphism Problem of Power Graphs and a Question of Cameron
Bireswar Das, Jinia Ghosh, Anant Kumar
The isomorphism problem for graphs (GI) and the isomorphism problem for groups (GrISO) have been studied extensively by researchers. The current best algorithms for both these prob…