Trees in Algebra and Programming - CAAP '96
21st International Colloquium, Linköping, Sweden, April 22-24, 1996. Proceedings (Lecture Notes in Computer Science)
1 edition
Our rough guess is there are 82,750 words in this book.
At a pace averaging 250 words per minute, this book will take 5 hours and 31 minutes to read. With a half hour per day, this will take 11 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
82,750 words, Guess
Page Count
331 pages
Physical Format
Paperback
Identifiers
- ISBN-103540610642
- ISBN-139783540610649
- Open LibraryOL9061803M
First Sentence
Local computations on graphs are formalized as modifications of labels (or states) attached to vertices or edges.
Subjects
Topics
Similar Books
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Rajeev Motwani, John E. Hopcroft, Jeffrey D. Ullman
A Beginner's Guide to Graph Theory
W.D. Wallis
Computers and Games: 4th International Conference, CG 2004, Ramat-Gan, Israel, July 5-7, 2004. Revised Papers (Lecture Notes in Computer Science)
Yngvi Björnsson, Nathan S. Netanyahu, H. Jaap van den Herik
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!