Graph partitioning and graph clustering
10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA
Our rough guess is there are 60,000 words in this book.
At a pace averaging 250 words per minute, this book will take 4 hours and 0 minutes to read. With a half hour per day, this will take 8 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.
We earn a commission on purchases
Contributions
- Bader, David A., 1969- editor of compilation - Contributor
- Meyerhenke, Henning, 1978- editor of compilation - Contributor
- Sanders, Peter, editor of compilation - Contributor
- Wagner, Dorothea, 1957- editor of compilation - Contributor
Publication
2013 - American Mathematical Society, Providence, Rhode Island, Rhode Island
Language
English
Word Count
60,000 words, Guess
Page Count
240 pages
Identifiers
- Open LibraryOL30663052M
- ISBN-139780821890387
- OCLC Control Number829644505
- OCLC Control Numbergraphpartitionin0000dima
- Library of Congress Control Number2012048265
Classifications
- DDC511/.5
- LCCQA166.245 .D56 2013
Description
xiii, 240 pages : 26 cm
Subjects
Topics
Series Statement
- Contemporary mathematics -- volume 588
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!