An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs (Q4337655)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs |
scientific article; zbMATH DE number 1012892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9393099546432496
0 references
0.8854645490646362
0 references
0.8826960325241089
0 references
