3 citations · 4 across the 4 of their papers we have counts for
1 paper · 1 filter
Prasad Chebolu, Mary Cryan, Russell Martin
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm…