Graph-Theoretic Concepts in Computer Science : 26th International Workshop, WG 2000 Konstanz, Germany, June 15-17, 2000 Proceedings / edited by Ulrik Brandes, Dorothea Wagner.

Format:

Book

Contributor:

Brandes, Ulrik, editor.

Wagner, Dorothea, 1957- editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

Lecture notes in computer science 0302-9743 ; 1928.

Lecture Notes in Computer Science, 0302-9743 ; 1928

Language:

English

Subjects (All):

Computer programming.

Computers.

Data structures (Computer science).

Algorithms.

Computer science--Mathematics.

Computer science.

Programming Techniques.

Theory of Computation.

Data Structures and Information Theory.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Data Structures.

Local Subjects:

Programming Techniques.

Theory of Computation.

Data Structures and Information Theory.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Data Structures.

Physical Description:

1 online resource (X, 313 pages).

Edition:

First edition 2000.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.

System Details:

text file PDF

Summary:

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).

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 K n,n

Tree Spanners for Subgraphs and Related Tree Covering Problems

Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization

The Expressive Power and Complexity of Dynamic Process Graphs

Bandwidth of Split and Circular Permutation Graphs

Recognizing Graphs without Asteroidal Triples (Extended Abstract)

Budget Constrained Minimum Cost Connected Medians

Coloring Mixed Hypertrees

A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs

Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables.

Other Format:

Printed edition:

ISBN:

978-3-540-40064-6

9783540400646

Access Restriction:

Restricted for use by site license.