An edition of An O(/E/loglog/V/) algorithm for finding minimum spanning trees (1974)

An O(/E/loglog/V/) algorithm for finding minimum spanning trees

by

An O(/E/loglog/V/) algorithm for finding mini ...
Andrew Chi-Chih Yao, Andrew Ch ...
Locate

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today
Notes
Notes

Buy this book

Last edited by Open Library Bot
December 5, 2010 | History
Edit
An edition of An O(/E/loglog/V/) algorithm for finding minimum spanning trees (1974)

An O(/E/loglog/V/) algorithm for finding minimum spanning trees

by

This work doesn't have a description yet. Can you add one?

Publish Date
Publisher
Dept. of Computer Science, University of Illinois at Urbana-Champaign
Language
English

Buy this book

Subjects

Data processing, Trees (Graph theory)
Edition Availability
Cover of: An O(/E/loglog/V/) algorithm for finding minimum spanning trees
An O(/E/loglog/V/) algorithm for finding minimum spanning trees
1974, Dept. of Computer Science, University of Illinois at Urbana-Champaign
in English

Add another edition?

Book Details

Edition Notes

Includes bibliographical references.

Published in
Urbana
Series
[Report] - UIUCDCS-R-74 ; 691

Classifications

Dewey Decimal Class
001.6/4/08 s, 511/.5
Library of Congress
QA76 .I4 no. 691, QA166.2 .I4 no. 691

The Physical Object

Pagination
6 leaves ;

Edition Identifiers

Open Library
OL4856756M
LCCN
75621755

Work Identifiers

Work ID
OL6889522W

Source records

Library of Congress MARC record

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
December 5, 2010 Edited by Open Library Bot Added subjects from MARC records.
December 10, 2009 Created by WorkBot add works page