An algorithm for enumerating all spanning trees of a directed graph (Q1977130)
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: An algorithm for enumerating all spanning trees of a directed graph |
scientific article; zbMATH DE number 1444106
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for enumerating all spanning trees of a directed graph |
scientific article; zbMATH DE number 1444106 |
Statements
An algorithm for enumerating all spanning trees of a directed graph (English)
0 references
18 December 2000
0 references
spanning trees
0 references
directed graph
0 references
