An algorithm for enumerating all directed spanning trees in a directed graph (Q6487436)
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 directed spanning trees in a directed graph |
scientific article; zbMATH DE number 7645880
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for enumerating all directed spanning trees in a directed graph |
scientific article; zbMATH DE number 7645880 |
Statements
An algorithm for enumerating all directed spanning trees in a directed graph (English)
0 references
25 January 2023
0 references
