EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH (Q5285185): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:06, 8 February 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
