EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH (Q5285185): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 19:38, 5 March 2024
scientific article; zbMATH DE number 975767
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH |
scientific article; zbMATH DE number 975767 |
Statements
EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH (English)
0 references
25 May 1997
0 references
undirected graph
0 references
enumerating all spanning trees
0 references
