Complexity of computation of a spanning tree enumeration algorithm (Q3341895)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3876589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of computation of a spanning tree enumeration algorithm |
scientific article; zbMATH DE number 3876589 |
Statements
Complexity of computation of a spanning tree enumeration algorithm (English)
0 references
1984
0 references
spanning tree enumeration algorithm
0 references
complexity analysis of Char's algorithm
0 references
speed up
0 references
path compression
0 references
0.93372375
0 references
0.93062407
0 references
0.90396106
0 references
0.90396106
0 references
0.90322596
0 references
0.90045565
0 references
