9 citations · 11 across the 8 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★ 1 cited
Counting Euler Tours in Undirected Bounded Treewidth Graphs
Nikhil Balaji, Samir Datta, Venkatesh Ganesan
We show that counting Euler tours in undirected bounded tree-width graphs is tractable even in parallel - by proving a upper bound. This is in stark contrast to #P-comple…