Graph-Theoretic Concepts in Computer Science
38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers
Our rough guess is there are 86,500 words in this book.
At a pace averaging 250 words per minute, this book will take 5 hours and 46 minutes to read. With a half hour per day, this will take 12 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.
Author
Contributions
- Stern, Michal - Contributor
- Levy, Avivit - Contributor
- Morgenstern, Gila - Contributor
- SpringerLink (Online service) - Contributor
Publication
2012 - Imprint: Springer, Berlin, Heidelberg, Germany
Language
English
Word Count
86,500 words, Guess
Page Count
346 pages
Physical Format
Electronic resource
Identifiers
- Internet Archivegraphtheoreticco00raut
- ISBN-139783642346118
- ISBN-103642346111
- Better World Books9783642346118
- Open LibraryOL27041755M
Classifications
- DDC004.0151
- LCCQA76.9.M35
- LCCQA75.5-76.95
and 1 more
- LCCQA76.9.M35
Description
This book constitutes the thoroughly refereed proceedings of the 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012) held in Jerusalem, Israel on June 26-28, 2012. The 29 revised full papers presented were carefully selected and reviewed from 78 submissions. The papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, computational geometry, tools for software construction, communications, computing on the web, models of the web and scale-free networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition
Subjects
Other Editions
- Graph-Theoretic Concepts in Computer Science: 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers
Similar Books
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
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
Applied Algorithms: First International Conference, ICAA 2014, Kolkata, India, January 13-15, 2014. Proceedings
Christos Zaroliagis, Prosenjit Gupta
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!