C. Seshadhri

activity

20082025

most citedThe impossibility of low rank representations for triangle-rich complex networks

49 citations · 287 across the 45 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

cs.SI2019★ 4 cited

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…

cs.DM2019

Random walks and forbidden minors II: A $poly (d ε^{- 1})$ -query tester for minor-closed properties of bounded-degree graphs

Akash Kumar, C. Seshadhri, Andrew Stolman

Let $G$ be a graph with $n$ vertices and maximum degree $d$ . Fix some minor-closed property $P$ (such as planarity). We say that $G$ is $ε$ -far from $\mathcal{P…

Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE

Random walks and forbidden minors II: A poly(dε−1)-query tester for minor-closed properties of bounded-degree graphs

Random walks and forbidden minors II: A $poly (d ε^{- 1})$ -query tester for minor-closed properties of bounded-degree graphs