Graph-Theoretic Concepts in Computer Science: 26th International Workshop, WG 2000 Konstanz, Germany, June 15–17, 2000 Proceedings

Ingo Wegener (auth.), Ulrik Brandes, Dorothea Wagner (eds.)3540411836, 9783540411833

The 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000) was held at Waldhaus Jakob, in Konstanz, Germany, on 15{ 17 June 2000. It was organized by the Algorithms and Data Structures Group of the Department of Computer and Information Science, University of K- stanz, and sponsored by Deutsche Forschungsgemeinschaft (DFG) and Univ- sit¨atsgesellschaft Konstanz. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions for future research. The workshop looks back on a remarkable tradition of more than a quarter of a century. Previous Workshops have been organized in various places in Europe, and submissions come from all over the world. This year, 57 attendees from 13 di erent countries gathered in the relaxing atmosphere of Lake Constance, also known as the Bodensee. Out of 51 submis- ons, the program committee carefully selected 26 papers for presentation at the workshop. This selection re?ects current research directions, among them graph and network algorithms and their complexity, algorithms for special graph cl- ses, communication networks, and distributed algorithms. The present volume contains these papers together with the survey presented in an invited lecture by Ingo Wegener (University of Dortmund) and an extended abstract of the invited lecture given by Emo Welzl (ETH Zuric ¨ h).

---

Table of contents :
On the Expected Runtime and the Success Probability of Evolutionary Algorithms (Invited Presentation)….Pages 1-10
n Points and One Line: Analysis of Randomized Games (Abstract of Invited Lecture)….Pages 11-12
Approximating Call-Scheduling Makespan in All-Optical Networks….Pages 13-22
New Spectral Lower Bounds on the Bisection Width of Graphs….Pages 23-34
Traversing Directed Eulerian Mazes (Extended Abstract)….Pages 35-46
On the Space and Access Complexity of Computation DAGs….Pages 47-58
Approximating the Treewidth of AT-Free Graphs….Pages 59-70
Split-Perfect Graphs: Characterizations and Algorithmic Use….Pages 71-82
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs….Pages 83-94
Networks with Small Stretch Number (Extended Abstract)….Pages 95-106
Efficient Dispersion Algorithms for Geometric Intersection Graphs….Pages 107-115
Optimizing Cost Flows by Modifying Arc Costs and Capacities….Pages 116-126
Update Networks and Their Routing Strategies….Pages 127-136
Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults….Pages 137-148
Diameter of the Knödel Graph….Pages 149-160
On the Domination Search Number….Pages 161-171
Efficient Communication in Unknown Networks….Pages 172-183
Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract)….Pages 184-195
The Tree-Width of Clique-Width Bounded Graphs without K n,n ….Pages 196-205
Tree Spanners for Subgraphs and Related Tree Covering Problems….Pages 206-217
Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization….Pages 218-229
The Expressive Power and Complexity of Dynamic Process Graphs….Pages 230-242
Bandwidth of Split and Circular Permutation Graphs….Pages 243-254
Recognizing Graphs without Asteroidal Triples (Extended Abstract)….Pages 255-266
Budget Constrained Minimum Cost Connected Medians….Pages 267-278
Coloring Mixed Hypertrees….Pages 279-289
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs….Pages 290-301
Optimal Fault-Tolerant Routings for k -Connected Graphs with Smaller Routing Tables….Pages 302-313