15 citations · 21 across the 14 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015
Graph properties in node-query setting: effect of breaking symmetry
Nikhil Balaji, Samir Datta, Raghav Kulkarni +1
The query complexity of graph properties is well-studied when queries are on edges. We investigate the same when queries are on nodes. In this setting a graph on v…
cs.CC2015
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism
Raghav Kulkarni, Supartha Podder
Let be a fixed graph on vertices. Let iff the input graph on vertices contains as a (not necessarily induced) subgraph. Let denote the cardin…