Graph-Theoretic Concepts in Computer Sciences
International Workshop Wg 88 Amsterdam, the Netherlands, June 15-17, 1988. Proceedings (Lecture Notes in Computer Science)
Our rough guess is there are 114,750 words in this book.
At a pace averaging 250 words per minute, this book will take 7 hours and 39 minutes to read. With a half hour per day, this will take 16 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.
Word Count
114,750 words, Guess
Page Count
459 pages
Physical Format
Paperback
Identifiers
- ISBN-103540507280
- ISBN-139783540507284
- Better World Books9783540507284
- Open LibraryOL9058206M
Classifications
- LCCQA1-939
First Sentence
The class of graphs with treewidth k has the property that many graph problems, which are NP-complete for arbitrary graphs, become solvable in polynomial time, when restricted to this class [4,3,6,9,18,17].
Subjects
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!