A minimum spanning tree algorithm with inverse-Ackermann type complexity (Q4406298)
From MaRDI portal
scientific article; zbMATH DE number 1935093
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A minimum spanning tree algorithm with inverse-Ackermann type complexity |
scientific article; zbMATH DE number 1935093 |
Statements
A minimum spanning tree algorithm with inverse-Ackermann type complexity (English)
0 references
25 June 2003
0 references
deterministic algorithm
0 references
minimum spanning tree
0 references
connected graph
0 references
