Faster deterministic algorithm for minimum spanning trees

Research output: Contribution to journalArticle

15 Scopus citations

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 languageEnglish (US)
Pages (from-to)22-31
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - Dec 1 1997

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this