Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph | Zendy

Maumita Chakraborty | Zendy; Sumon Chowdhury | Zendy; Rajat K. Pal | Zendy

Open Access

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

Publication year - 2018

Publication title -

ieee access

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.587

H-Index - 127

ISSN - 2169-3536

DOI - 10.1109/access.2018.2872737

Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation

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 have the capability to solve the major bottlenecks in this area, namely, generation of duplicate trees and circuit checking. In the first algorithm, the given graph has been converted to its corresponding weighted complete graph, which proposes to have novelties and limitations of its own. In addition, we have also proposed another related algorithm, and as a result, we have been able to come up with new ideas in this research domain of graph theory.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research