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