Abstract
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m α log α), where α = α(m, n) is a functional inverse of Ackermann's function and n (resp. m) is the number of vertices (resp. edges). This improves on the previous, ten-year old bound of (roughly) O(m log log* m).
| Original language | English (US) |
|---|---|
| Pages (from-to) | 22-31 |
| Number of pages | 10 |
| Journal | Annual Symposium on Foundations of Computer Science - Proceedings |
| State | Published - Dec 1 1997 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture