Listing all spanning trees in Halin graphs — sequential and Parallel view
From MaRDI portal
Publication:4603872
DOI10.1142/S1793830918500052zbMath1380.05106arXiv1511.01696OpenAlexW2963690661MaRDI QIDQ4603872
N. Sadagopan, K. Krishna Mohan Reddy, P. Renjith
Publication date: 23 February 2018
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.01696
Trees (05C05) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- VPG and EPG bend-numbers of Halin graphs
- Efficient enumeration of ordered trees with \(k\) leaves
- The bridge-connectivity augmentation problem with a partition constraint
- Boxicity of Halin graphs
- A flexible algorithm for generating all the spanning trees in undirected graphs
- Efficient generation of plane trees.
- An algorithm for enumerating all spanning trees of a directed graph
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- An Efficient Parallel Biconnectivity Algorithm
- On maximal independent sets of nodes in trees
- Efficient Planarity Testing
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- A New Algorithm for Generating All the Maximal Independent Sets
- Finding All Spanning Trees of Directed and Undirected Graphs
- Listing all Minimal Separators of a Graph
- Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
- Testing bipartiteness of geometric intersection graphs
- EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
This page was built for publication: Listing all spanning trees in Halin graphs — sequential and Parallel view
