collaborators

1 paper

cs.CC2010

The Complexity of Counting Eulerian Tours in 4-Regular Graphs

Qi Ge, Daniel Stefankovic

We investigate the complexity of counting Eulerian tours ({\sc #ET}) and its variations from two perspectives---the complexity of exact counting and the complexity w.r.t. approxima…