A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Exact counting of Euler Tours for generalized series-parallel graphs
[article]
2010
arXiv
pre-print
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 to exactly sample a random ET of the given generalized series-parallel graph. Note that the class of generalized seriesparallel graphs includes all outerplanar graphs. We can perform the counting in time O(mΔ^3), where Δ is the maximum degree of the graph with m edges. We use O(mΔ^2 Δ) bits to store intermediate
arXiv:1005.3477v1
fatcat:wcckfcxszndxnmumjaqi5nxqpa