A parallel algorithm for the enumeration of the spanning trees of a graph (Q1058301)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A parallel algorithm for the enumeration of the spanning trees of a graph |
scientific article; zbMATH DE number 3900174
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for the enumeration of the spanning trees of a graph |
scientific article; zbMATH DE number 3900174 |
Statements
A parallel algorithm for the enumeration of the spanning trees of a graph (English)
0 references
1985
0 references
The problem of enumerating the spanning trees of a graph arises in several contexts such as computer-aided design and computer networks. A parallel algorithm for solving the problem is presented in this paper. It is based on the principle of the inclusion and exclusion of sets, and not directly based on the partitioning of the graph itself. The results of the preliminary experiments on a MIMD system appear promising.
0 references
MIMD computer
0 references
spanning trees
0 references
parallel algorithm
0 references
