Finding Minimum Spanning Trees in O(m α(m,n)) Time

Finding Minimum Spanning Trees in O(m α(m,n)) Time (1999)

by Seth Pettie

User correction supplied by mph

Datum	Value	Source
TITLE	Finding Minimum Spanning Trees in O(m α(m,n)) Time	user correction
AUTHOR NAME	Seth Pettie	user correction
AUTHOR AFFIL	Department of Computer Sciences; The University of Texas at Austin	user correction
AUTHOR ADDR	Austin, TX 78712	user correction
ABSTRACT	We describe a deterministic minimum spanning tree algorithm running in time O(m α(m; n)), where α is a natural inverse of Ackermann's function and m and n are the number of edges and vertices, respectively. This improves upon the O(m α(m; n) log α(m; n)) bound established by Chazelle in 1997. A similar O(m α(m; n))-time algorithm was discovered independently by Chazelle, predating the algorithm presented here by many months. This paper may still be of interest for its alternative exposition.	user correction
YEAR	1999	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
PAGES	3--371	INFERENCE
TECH	Tech Report TR99-23	INFERENCE
CITATIONS	19 found	ParsCit 1.0