An algorithm for enumerating all spanning trees of a directed graph (Q1977130): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090660215 / rank | |||
Normal rank | |||
Latest revision as of 20:08, 19 March 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
