Book ChapterDOI
A Divide-and-Conquer Algorithm for All Spanning Tree Generation
Maumita Chakraborty,Ranjan Mehera,Rajat Kumar Pal +2 more
- pp 19-36
TLDR
This paper claims to propose a unique solution to the problem of all possible spanning tree enumeration for a simple, symmetric, and connected graph based on the algorithmic paradigm named divide-and-conquer.Abstract:
This paper claims to propose a unique solution to the problem of all possible spanning tree enumeration for a simple, symmetric, and connected graph. It is based on the algorithmic paradigm named divide-and-conquer. Our algorithm proposes to perform no duplicate tree comparison and a minimum number of circuit testing, consuming reasonable time and space.read more
Citations
More filters
Book ChapterDOI
Algorithm to Generate All Spanning Tree Structures of a Complete Graph
TL;DR: In this article, the authors proposed an algorithm to generate all possible structures of spanning trees of an undirected complete graph of n vertices, where the process starts with a star-tree (T) of the given complete graph and then replaces the edges of T one by one to generate different possible structures like chain, branch, etc.
Posted Content
A note on Graphical Notation Reveals Topological Stability Criteria for Collective Dynamics in Complex Network
TL;DR: This paper clarifies the main research methods and ideas of the thesis and gives the corresponding algorithm, which greatly simplifies the relevant calculation of paper.
Journal ArticleDOI
Automatic computing of the grand potential in finite temperature many-body perturbation theory
M. A. Tag,M. E. Mansour +1 more
TL;DR: A new program created in C/C++ language generates automatically the analytic expression of grand potential and prints it in Latex2e format and in textual data.
References
More filters
Journal ArticleDOI
Finding All Spanning Trees of Directed and Undirected Graphs
Harold N. Gabow,Eugene W. Myers +1 more
TL;DR: An algorithm for finding all spanning trees (arborescences) of a directed graph is presented that uses backtracking and a method for detecting bridges based on depth-first search.
Journal ArticleDOI
Algorithms for Enumerating All Spanning Trees ofUndirected and Weighted Graphs
Sanjiv Kapoor,H. Ramesh +1 more
TL;DR: Algorithms for enumeration of spanning trees in undirected graphs, with and without weights, are presented, based on swapping edges in a fundamental cycle to construct a computation tree.
Journal ArticleDOI
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
TL;DR: The Shioura and Tamura algorithm is optimal in the sense of both time and space complexities because it decreases the space complexity from O(VE) to O(V + E) while preserving the time complexity.
Journal ArticleDOI
Generation of Trees without Duplications
W. Mayeda,S. Seshu +1 more
TL;DR: A practical procedure satisfying these conditions is presented and it is shown that for practical networks the number of trees exceeds the fast memory of any computer and, hence, slows down search for duplicates.