An algorithm to generate all spanning trees of a graph in order of increasing cost
A minimum spanning tree of an undirected graph can be easily obtained using classical algorithms by Prim or Kruskal. A number of algorithms have been proposed to enumerate all spanning trees of an undirected graph. Good time and space complexities are the major concerns of these algorithms. Most alg...
Main Authors: | Kenneth Sörensen, Gerrit K. Janssens |
---|---|
Format: | Article |
Language: | English |
Published: |
Sociedade Brasileira de Pesquisa Operacional
2005-08-01
|
Series: | Pesquisa Operacional |
Subjects: | |
Online Access: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382005000200004 |
Similar Items
-
Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
by: Sung Sik U
Published: (2016-10-01) -
The Spanning Tree of a Divisible Multiple Graph
by: Alexander V. Smirnov
Published: (2018-08-01) -
On the Minimum Number of Spanning Trees in Cubic Multigraphs
by: Bogdanowicz Zbigniew R.
Published: (2020-02-01) -
Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph
by: Maumita Chakraborty, et al.
Published: (2018-01-01) -
Tree Graphs and Orthogonal Spanning Tree Decompositions
by: Mahoney, James Raymond
Published: (2016)