The graph isomorphism problem
its structural complexity
Our rough guess is there are 40,000 words in this book.
At a pace averaging 250 words per minute, this book will take 2 hours and 40 minutes to read. With a half hour per day, this will take 6 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.
Get it on Amazon
We earn a commission on purchases
Contributions
- Schöning, Uwe, 1955- - Contributor
- Torán, Jacobo, 1962- - Contributor
Publication
1993 - Birkhäuser, Boston, Massachusetts
Language
English
Word Count
40,000 words, Guess
Page Count
160 pages
Identifiers
- Open LibraryOL1412979M
- ISBN-100817636803
- OCLC Control Number27432721
- OCLC Control Numbergraphisomorphism0000kobl
- Library of Congress Control Number93022011
and 1 more
- Goodreads2159080
Classifications
- DDC511/.5
- LCCQA267.7 .K63 1993
Subjects
Topics
AppliedGeneralComputersGraph theoryData processingGraphic MethodsComputer ScienceMathematics-AppliedApplied mathematicsScience/MathematicsTheory Of ComputingComputer Books: GeneralComputational complexityComputational complexity.Isomorphisms (Mathematics)Mathematics-Graphic MethodsComputers / Computer ScienceComputers - General InformationGraph theory -- Data processing.Mathematical theory of computationComputer architecture & logic design
Series Statement
- Progress in theoretical computer science
Other Editions
- The graph isomorphism problem: its structural complexity
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!