Header menu link for other important links
X
A divide-and-conquer algorithm for all spanning tree generation
M CHAKRABORTY, R MEHERA,
Published in Springer Verlag
2017
Volume: 567
   
Pages: 19 - 36
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. © Springer Nature Singapore Pte Ltd. 2017.
About the journal
JournalData powered by TypesetAdvances in Intelligent Systems and Computing
PublisherData powered by TypesetSpringer Verlag
ISSN2194-5357
Open AccessNo