Listing All Spanning Trees in Halin Graphs - Sequential and Parallel view
K. Krishna Mohan Reddy, P. Renjith, N. Sadagopan

TL;DR
This paper introduces sequential and parallel algorithms for listing all spanning trees in Halin graphs, efficiently handling the enumeration without repetitions and analyzing the computational complexity.
Contribution
It presents the first known algorithms for enumerating all spanning trees in Halin graphs, including a parallel approach with processor complexity analysis.
Findings
Enumeration without repetitions achieved
Parallel algorithm uses $O((2pd)^p)$ processors
Number of spanning trees in Halin graphs is $O((2pd)^p)$
Abstract
For a connected labelled graph , a {\em spanning tree} is a connected and an acyclic subgraph that spans all vertices of . In this paper, we consider a classical combinatorial problem which is to list all spanning trees of . 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 processors for parallel algorithmics, where and 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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Interconnection Networks and Systems
