An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs (Q4337655): 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.1137/s0097539794270881 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988738304 / rank | |||
Normal rank | |||
Latest revision as of 09:54, 30 July 2024
scientific article; zbMATH DE number 1012892
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs |
scientific article; zbMATH DE number 1012892 |
Statements
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs (English)
0 references
26 May 1997
0 references
optimal algorithm
0 references
spanning trees
0 references
undirected graphs
0 references
