1 citations · 1 across the 1 of their papers we have counts for
1 paper
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 #SAC1 upper bound. This is in stark contrast to #P-comple…