14 citations · 20 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020★ 2 cited
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles
Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
Counting homomorphisms of a constant sized pattern graph in an input graph is a fundamental computational problem. There is a rich history of studying the complexity of thi…
cs.DS2019★ 14 cited
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six
Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
We consider the problem of counting all -vertex subgraphs in an input graph, for any constant . This problem (denoted sub-cnt) has been studied extensively in both theory…