Data Structures and Algorithms 2
Graph Algorithms and NP-Completeness
Our rough guess is there are 13,500 words in this book.
At a pace averaging 250 words per minute, this book will take 0 hours and 54 minutes to read. With a half hour per day, this will take 2 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Publication
1984 - Springer Berlin Heidelberg, Berlin, Heidelberg, Germany
Language
English
Word Count
13,500 words, Guess
Page Count
54 pages
Physical Format
Electronic resource
Identifiers
- Internet Archivedatastructuresal00mehl_352
- ISBN-103642698972
- ISBN-139783642698972
- OCLC Control Number840294481
- Better World Books9783642698972
and 1 more
- Open LibraryOL27029447M
Classifications
- LCCQA75.5-76.95
Subjects
Series Statement
- EATCS Monographs on Theoretical Computer Science, 1431-2654 -- 2
- EATCS monographs on theoretical computer science -- 2.
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!