14 citations · 32 across the 13 of their papers we have counts for
Showing 2020 · cs.DSShow all
3 papers · 2 filters
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.DS2020★ 1 cited
How to Count Triangles, without Seeing the Whole Graph
Suman K. Bera, C. Seshadhri
Triangle counting is a fundamental problem in the analysis of large graphs. There is a rich body of work on this problem, in varying streaming and distributed models, yet all these…
cs.DS2020
How the Degeneracy Helps for Triangle Counting in Graph Streams
Suman K. Bera, C. Seshadhri
We revisit the well-studied problem of triangle count estimation in graph streams. Given a graph represented as a stream of edges, our aim is to compute a -a…