Graph-Theoretic Concepts in Computer Science
26th International Workshop, WG 2000 Konstanz, Germany, June 15-17, 2000 Proceedings (Lecture Notes in Computer Science)
1 edition
Our rough guess is there are 78,750 words in this book.
At a pace averaging 250 words per minute, this book will take 5 hours and 15 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.
Author
Contributions
- Ulrik Brandes (Editor) - Contributor
- Dorothea Wagner (Editor) - Contributor
Publication
2000-11-27 - Springer
Language
English
Word Count
78,750 words, Guess
Page Count
315 pages
Physical Format
Paperback
Identifiers
- Open LibraryOL12774531M
- ISBN-139783540411833
- ISBN-103540411836
- OCLC Control Number45484741
- OCLC Control Numberspringer_10.1007-3-540-40064-8
and 2 more
- Goodreads1639851
- LibraryThing7805473
Classifications
- LCCQA75.5-76.95
Description
Graph-Theoretic Concepts in Computer Science: 26th International Workshop, WG 2000 Konstanz, Germany, June 15–17, 2000 Proceedings<br />Author: Ulrik Brandes, Dorothea Wagner<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-41183-3<br /> DOI: 10.1007/3-540-40064-8<br /><br />Table of Contents:<p></p><ul><li>On the Expected Runtime and the Success Probability of Evolutionary Algorithms (Invited Presentation) </li><li>n Points and One Line: Analysis of Randomized Games (Abstract of Invited Lecture) </li><li>Approximating Call-Scheduling Makespan in All-Optical Networks </li><li>New Spectral Lower Bounds on the Bisection Width of Graphs </li><li>Traversing Directed Eulerian Mazes (Extended Abstract) </li><li>On the Space and Access Complexity of Computation DAGs </li><li>Approximating the Treewidth of AT-Free Graphs </li><li>Split-Perfect Graphs: Characterizations and Algorithmic Use </li><li>Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs </li><li>Networks with Small Stretch Number (Extended Abstract) </li><li>Efficient Dispersion Algorithms for Geometric Intersection Graphs </li><li>Optimizing Cost Flows by Modifying Arc Costs and Capacities </li><li>Update Networks and Their Routing Strategies </li><li>Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults </li><li>Diameter of the Knödel Graph </li><li>On the Domination Search Number </li><li>Efficient Communication in Unknown Networks </li><li>Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract) </li><li>The Tree-Width of Clique-Width Bounded Graphs without Kn,n </li><li>Tree Spanners for Subgraphs and Related Tree Covering Problems</li></ul>
Subjects
Topics
Other Editions
- Graph-Theoretic Concepts in Computer Science: 26th International Workshop, WG 2000 Konstanz, Germany, June 15-17, 2000 Proceedings (Lecture Notes in Computer Science)
Similar Books
A Beginner's Guide to Graph Theory
W.D. Wallis
Graph Cohomology
Maxim Kontsevich
Algorithm design
Jon Kleinberg, Éva Tardos
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)
Dieter Jungnickel
Thirty Essays on Geometric Graph Theory
János Pach
Applied combinatorics
Alan Tucker.
Graphs on surfaces and their applications
Sergei K. Lando, Alexander K. Zvonkin ; appendix by Don B. Zagier
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!