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: | , |
|---|---|
| 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 |