Graph-Theoretic Concepts in Computer Science

Graph-Theoretic Concepts in Computer Science: 26th International Workshop, WG 2000 Konstanz, Germany, June 15–17, 2000 ProceedingsAuthor: Ulrik Brandes, Dorothea Wagner Published by Springer Berlin Heidelberg ISBN: 978-3-540-41183-3 DOI: 10.1007/3-540-40064-8Table of Contents:On the Expected Runtime and the Success Probability of Evolutionary Algorithms (Invited Presentation)
n Points and One Line: Analysis of Randomized Games (Abstract of Invited Lecture)
Approximating Call-Scheduling Makespan in All-Optical Networks
New Spectral Lower Bounds on the Bisection Width of Graphs
Traversing Directed Eulerian Mazes (Extended Abstract)
On the Space and Access Complexity of Computation DAGs
Approximating the Treewidth of AT-Free Graphs
Split-Perfect Graphs: Characterizations and Algorithmic Use
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs
Networks with Small Stretch Number (Extended Abstract)
Efficient Dispersion Algorithms for Geometric Intersection Graphs
Optimizing Cost Flows by Modifying Arc Costs and Capacities
Update Networks and Their Routing Strategies
Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults
Diameter of the Knödel Graph
On the Domination Search Number
Efficient Communication in Unknown Networks
Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract)
The Tree-Width of Clique-Width Bounded Graphs without Kn,n
Tree Spanners for Subgraphs and Related Tree Covering Problems