Complexity of computation of a spanning tree enumeration algorithm (Q3341895): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tcs.1984.1085435 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2096544426 / rank | |||
Normal rank | |||
Latest revision as of 11:10, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of computation of a spanning tree enumeration algorithm |
scientific article |
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
