An edition of Two upper bounds for the weighted path length of binary trees (1973)

Two upper bounds for the weighted path length of binary trees.

by

Cover of: Two upper bounds for the weighted path length of binary trees. by Jean Louis Pradels, Jean Louis Pradels
Read Listen

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

Download Options

Buy this book

Last edited by MARC Bot
October 9, 2020 | History
Edit
An edition of Two upper bounds for the weighted path length of binary trees (1973)

Two upper bounds for the weighted path length of binary 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
Pages
11

Buy this book

Previews available in: English

Subjects

Data processing, Graph theory
Edition Availability
Cover of: Two upper bounds for the weighted path length of binary trees.
Two upper bounds for the weighted path length of binary trees.
1973, Dept. of Computer Science, University of Illinois at Urbana-Champaign
in English

Add another edition?

Book Details

Edition Notes

Includes bibliographical references.
Thesis (M.S.)--University of Illinois at Urbana-Champaign.

Published in
Urbana
Series
UIUCDCS-R-73-565

Classifications

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

The Physical Object

Pagination
iv l., 11 p.
Number of pages
11

ID Numbers

Open Library
OL5027266M
Internet Archive
twoupperboundsfo565prad
LCCN
73621931

Source records

Internet Archive item record
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
October 9, 2020 Edited by MARC Bot import existing book
December 5, 2010 Edited by Open Library Bot Added subjects from MARC records.
December 10, 2009 Created by WorkBot add works page