Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Exact counting of Euler Tours for Graphs of Bounded Treewidth   In this paper we give a simple polynomial-time algorithm to exactly count the
number of Euler Tours (ETs) of any Eulerian graph of bounded treewidth. The
problems of counting ETs are known to be #P-complete for general graphs
(Brightwell and Winkler, (Brightwell and Winkler, 2005). To date, no
polynomial-time algorithm for counting Euler tours of any class of graphs is
known except for the very special case of series-parallel graphs (which have
treewidth 2).

10
The categories of this paper are: q-bio
9
The categories of this paper are: nlin
36
The categories of this paper are: cmp-lg
0
The categories of this paper are: hep-ph
16
The categories of this paper are: stat
24
The categories of this paper are: dg-ga
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
8
The categories of this paper are: hep-ex
30
The categories of this paper are: q-alg
18
The categories of this paper are: econ
11
The categories of this paper are: hep-lat
17
The categories of this paper are: q-fin
33
The categories of this paper are: plasm-ph
12
The categories of this paper are: nucl-th
5
The categories of this paper are: gr-qc