An O(/E/loglog/V/) algorithm for finding minimum spanning trees
By: Andrew Chi-chih Yao.
Series: [Report] - UIUCDCS-R-74 ; 691
Publisher: Dept. of Computer Science, University of Illinois at Urbana-Champaign
Published: 1974
Place of publication: Urbana
Language: eng
Subjects: Trees (Graph theory) -- Data processing.
Notes: Includes bibliographical references.