Header menu link for other important links
Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph
M. Chakraborty, R. Mehera,
Published in Elsevier B.V.
Volume: 900
Pages: 35 - 52
All spanning tree generation of a simple connected graph is a well-approached problem in graph theory. In this paper, an algorithm based on a new technique, namely divide-and-conquer, has been proposed. The performance of the proposed algorithm has also been benchmarked against several existing algorithms, including one algorithm implemented in parallel, in this domain. The basis of comparison is on the number of circuits generated and CPU time taken by each of the algorithms compared, using a set of randomly generated graph instances on a common platform. © 2021 Elsevier B.V.
About the journal
JournalData powered by TypesetTheoretical Computer Science
PublisherData powered by TypesetElsevier B.V.