Algorithms for generating all possible spanning trees of a simple undirected connected graph: an extensive review
Crossref DOI link: https://doi.org/10.1007/s40747-018-0079-7
Published Online: 2018-08-13
Published Print: 2019-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Chakraborty, Maumita
Chowdhury, Sumon
Chakraborty, Joymallya
Mehera, Ranjan
Pal, Rajat Kumar
Text and Data Mining valid from 2018-08-13
Article History
Received: 25 August 2017
Accepted: 30 July 2018
First Online: 13 August 2018