14 citations · 20 across the 4 of their papers we have counts for
4 papers
Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering
Noujan Pashanasangi, C. Seshadhri
Triangle counting is a fundamental technique in network analysis, that has received much attention in various input models. The vast majority of triangle counting algorithms are ta…
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…
Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE
Noujan Pashanasangi, C. Seshadhri
Subgraph counting is a fundamental task in network analysis. Typically, algorithmic work is on total counting, where we wish to count the total frequency of a (small) pattern subgr…
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…