Graph-Theoretic Concepts in Computer Science
31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers (Lecture Notes in Computer Science)
1 edition
Our rough guess is there are 117,500 words in this book.
At a pace averaging 250 words per minute, this book will take 7 hours and 50 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
117,500 words, Guess
Page Count
470 pages
Physical Format
Paperback
Identifiers
- Internet Archivegraphtheoreticco00krat
- ISBN-103540310002
- ISBN-139783540310006
- LibraryThing7818850
- Goodreads6281517
and 1 more
- Open LibraryOL9056198M
Description
This book constitutes the thoroughly refereed post-conference proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, held in Nouan-le-Fuzelier, France, in June 2014. The 32 revised full papers presented were carefully reviewed and selected from 80 submissions. The book also includes two invited papers. The papers cover a wide range of topics in graph theory related to computer science, such as design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; structural graph theory with algorithmic or complexity applications; computational complexity of graph and network problems; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; computational geometry; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.
Subjects
Topics
Other Editions
- Graph-Theoretic Concepts in Computer Science: 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers (Lecture Notes in Computer Science)
Similar Books
Relational and Algebraic Methods in Computer Science: 14th International Conference, RAMiCS 2014, Marienstatt, Germany, April 28 -- May 1, 2014, Proceedings
Peter Jipsen, Michael Winter, Uli Fahrenberg, Peter Höfner, Martin Eric Müller, Wolfram Kahl
Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings
Ding-Zhu Du, Zhao Zhang, Wen Xu, Lidong Wu, Panos M. Pardalos, Xiaodong Hu
Algorithms in Bioinformatics: 14th International Workshop, WABI 2014, Wroclaw, Poland, September 8-10, 2014. Proceedings
Burkhard Morgenstern, Dan Brown (Teacher), Dan Brown
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
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Rajeev Motwani, John E. Hopcroft, Jeffrey D. Ullman
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!