Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph

DOI10.1016/j.tcs.2021.11.018OpenAlexW4200271635MaRDI QIDQ2062131

Rajat Kumar Pal, Ranjan Mehera, Maumita Chakraborty

Publication date: 22 December 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.11.018

zbMATH Keywords

graph theoryspanning treedivide-and-conquer

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• An algorithm for the enumeration of spanning trees
• A flexible algorithm for generating all the spanning trees in undirected graphs
• An algorithm for enumerating all spanning trees of a directed graph
• On trees of a graph and their generation
• New algorithm for generation of spanning trees
• Complexity of computation of a spanning tree enumeration algorithm
• Finding All Spanning Trees of Directed and Undirected Graphs
• An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
• MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
• EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH

This page was built for publication: Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph