Graph-Theoretic Concepts in Computer Science
15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings (Lecture Notes in Computer Science)
1 edition
Our rough guess is there are 93,500 words in this book.
At a pace averaging 250 words per minute, this book will take 6 hours and 14 minutes to read. With a half hour per day, this will take 13 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
93,500 words, Guess
Page Count
374 pages
Physical Format
Paperback
Identifiers
- Open LibraryOL9589892M
- ISBN-139783540522928
- ISBN-103540522921
- OCLC Control Number21038313
- OCLC Control Numbergraphtheoreticco00nagl
and 1 more
- Library of Congress Control Number90009493
Classifications
- LCCQA166 .G7172 1990
- LCCQA75.5-76.95
First Sentence
In this paper we study the problem of finding disjoint paths in a hypercube.
Subjects
Topics
Other Editions
- Graph-Theoretic Concepts in Computer Science: 15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings (Lecture Notes in Computer Science)
Similar Books
A Beginner's Guide to Graph Theory
W.D. Wallis
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)
Dieter Jungnickel
Applied combinatorics
Alan Tucker.
Graphs & digraphs.
Gary Chartrand, L. Lesniak
Introduction to Algorithms
Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, Charles E. Leiserson
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!