An optimal algorithm for scanning all spanning trees of undirected graphs.
Let G be an undirected graph with V vertices and E edges. Many algorithms have been developed for enumerating all spanning trees in G. Most of the early algorithms use a technique called "backtracking." Recently, several algorithms using a different technique have been proposed by Kapoor a...
| Pubblicato in: | SIAM journal on computing. 26, 3 (1997). |
|---|---|
| Autore principale: | |
| Natura: | Articolo |
| Lingua: | English |
| Soggetti: |