A minimum spanning tree algorithm with inverse-Ackermann type complexity

Saved in:
Bibliographic Details
Published inJournal of the ACM
Format Journal Article
LanguageEnglish
Published 01.11.2000
Online AccessGet full text
ISSN1557-735X
0004-5411
DOI10.1145/355541.355562

Cover

More Information
ISSN:1557-735X
0004-5411
DOI:10.1145/355541.355562