Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph
| Autor: | Sumon Chowdhury, Maumita Chakraborty, Rajat Kumar Pal |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
General Computer Science
Computer science Computation graph theory 02 engineering and technology 01 natural sciences 0103 physical sciences 0202 electrical engineering electronic engineering information engineering General Materials Science weighted graph complete graph Connectivity 010302 applied physics spanning tree Spanning tree General Engineering Complete graph 020206 networking & telecommunications Graph theory Graph Algorithm Statistical classification Graph (abstract data type) lcsh:Electrical engineering. Electronics. Nuclear engineering lcsh:TK1-9971 |
| Zdroj: | IEEE Access, Vol 6, Pp 56290-56300 (2018) |
| ISSN: | 2169-3536 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|