Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Listing All Spanning Trees in Halin Graphs - Sequential and Parallel
  view   For a connected labelled graph $G$, a {\em spanning tree} $T$ is a connected
and an acyclic subgraph that spans all vertices of $G$. In this paper, we
consider a classical combinatorial problem which is to list all spanning trees
of $G$. A Halin graph is a graph obtained from a tree with no degree two
vertices and by joining all leaves with a cycle. We present a sequential and
parallel algorithm to enumerate all spanning trees in Halin graphs. Our
approach enumerates without repetitions and we make use of $O((2pd)^{p})$
processors for parallel algorithmics, where $d$ and $p$ are the depth, the
number of leaves, respectively, of the Halin graph. We also prove that the
number of spanning trees in Halin graphs is $O((2pd)^{p})$.

3
The categories of this paper are: physics
34
The categories of this paper are: chem-ph
12
The categories of this paper are: nucl-th
35
The categories of this paper are: mtrl-th
14
The categories of this paper are: math-ph
6
The categories of this paper are: astro-ph
8
The categories of this paper are: hep-ex
5
The categories of this paper are: gr-qc
28
The categories of this paper are: alg-geom
2
The categories of this paper are: math
19
The categories of this paper are: eess
33
The categories of this paper are: plasm-ph
0
The categories of this paper are: hep-ph
24
The categories of this paper are: dg-ga
15
The categories of this paper are: nucl-ex
18
The categories of this paper are: econ