IEEE - Institute of Electrical and Electronics Engineers, Inc. - Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph

Author(s): Maumita Chakraborty ; Sumon Chowdhury ; Rajat K. Pal
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Volume: PP
Page(s): 1
ISSN (Electronic): 2169-3536
DOI: 10.1109/ACCESS.2018.2872737
Regular:

In this paper, we have proposed altogether different and new approaches for the computation of all possible spanning trees of a simple, undirected, and connected graph. Our proposed algorithms... View More

Advertisement