EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH (Q5285185): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.15807/jorsj.38.331 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W344142806 / rank | |||
Normal rank | |||
Latest revision as of 02:48, 20 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
