Thumbnail
Access Restriction
Subscribed

Author Chazelle, Bernard
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2000
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Graphs ♦ Matroids ♦ Minimum spanning trees
Abstract A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is $\textit{0}(\textit{m}$ α(m, n)), where α is the classical functional inverse of Ackermann's function and $\textit{n}$ (respectively, $\textit{m})$ is the number of vertices (respectively, edges). The algorithm is comparison-based : it uses pointers, not arrays, and it makes no numeric assumptions on the edge costs.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2000-11-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 47
Issue Number 6
Page Count 20
Starting Page 1028
Ending Page 1047


Open content in new tab

   Open content in new tab
Source: ACM Digital Library