An algorithm for enumerating all spanning trees of a directed graph (Q1977130): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:41, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for enumerating all spanning trees of a directed graph |
scientific article |
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
