A flexible algorithm for generating all the spanning trees in undirected graphs (Q1361419)
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: A flexible algorithm for generating all the spanning trees in undirected graphs |
scientific article; zbMATH DE number 1038929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A flexible algorithm for generating all the spanning trees in undirected graphs |
scientific article; zbMATH DE number 1038929 |
Statements
A flexible algorithm for generating all the spanning trees in undirected graphs (English)
0 references
23 July 1997
0 references
spanning trees
0 references
0.8826960325241089
0 references
0.8612251281738281
0 references
