2 search results - page 1 / 1 » The Complexity of Counting Eulerian Tours in 4-Regular Graph... |
LATIN
2010
Springer
13 years 9 months ago
2010
Springer
CORR
2010
Springer
13 years 4 months ago
2010
Springer
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...