Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs (1995)
by
Sanjiv Kapoor
,
H. Ramesh
| Venue: | SIAM J. Comput |
| Citations: | 14 - 0 self |
BibTeX
@ARTICLE{Kapoor95algorithmsfor,
author = {Sanjiv Kapoor and H. Ramesh},
title = {Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs},
journal = {SIAM J. Comput},
year = {1995},
volume = {24},
pages = {247--265}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we present algorithms for enumeration of spanning trees in undirected graphs, with and without weights.
Citations
| 57 | Bounds on backtrack algorithms for listing cycles, paths, and spanning trees - Read, Tarjan - 1975 |
| 22 | Two algorithms for generating weighted spanning trees in order - Gabow - 1977 |
| 18 | Finding All Spanning Trees of Directed and Undirected Graphs - Gabow, Myers - 1978 |
| 12 | A simple algorithm for listing all trees of a graph - Minty - 1965 |
| 6 | Graph Theory - Mayeda - 1972 |
| 2 | Analysis and study of a spanning tree enumeration algorithm - Jayakumar - 1980 |
| 2 | An algorithm for generating all spanning trees of directed graphs, manuscript, submitted to - Kapoor, Ramesh - 1995 |
| 1 | Generation of trees, 2 trees and storage of master forests - Char |
| 1 | A study of algorithms to enumerate all stable matchings and spanning trees - James |
| 1 | Complexity of Computation of a spanning tree enumeration algorithm - Jayaraman, Thulasiraman |
| 1 | Microprocessor based Char's tree enumeration algorithm - Kalra, Jamuar |
