1 citations · 2 across the 4 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014★ 1 cited
Counting cliques and clique covers in random graphs
Kashyap Dixit, Martin Fürer
We study the problem of counting the number of {\em isomorphic} copies of a given {\em template} graph, say , in the input {\em base} graph, say . In general, it is believed…
cs.DS2014
-Testers for Bounded Derivative Properties on Product Distributions
Kashyap Dixit
We consider the problem of -testing of class of bounded derivative properties over hypergrid domain with points distributed according to some product distribution. This class…