Abstract
Exhaustive enumeration of spanning trees in a graph requires substantial time and computational overheads. The proposed method, using the concept of LOOP DOMAIN, greatly reduces the complexity of enumeration. The initial graph is transformed into a graph in loop domain where the spanning tree enumeration is then carried out. Subsequently spanning trees of initial graph are generated. The proposed method eliminates all the two degree vertices in a graph. This finds application in power system distribution networks, which have substantial number of two degree vertices. The consequent reduction in size of graph and its corresponding trees is highly desirable. The proposed method is demonstrated on a 33 vertex system and reduction incomplexity is evaluated.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
