๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Algorithm for Enumerating All Spanning Trees of a Directed Graph

โœ Scribed by S. Kapoor; H. Ramesh

Publisher
Springer
Year
2000
Tongue
English
Weight
61 KB
Volume
27
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A parallel algorithm for the enumeration
A parallel algorithm for the enumeration of the spanning trees of a graph
โœ Shao-Wen Mai; D.J. Evans ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 450 KB

As is well known, the strategy of divide-and-conquer is widely used in problem solving. The method of partitioning is also a fundamental strategy for the design of a parallel algorithm. The problem of enumerating the spanning trees of a graph arises in several contexts such as computer-aided design