Happy holidays from us to you—get up to $30 off your next print or eBook! Shop now >>

Lecture Notes in Computer Science

Graph-Theoretic Concepts in Computer Science

26th International Workshop, WG 2000 Konstanz, Germany, June 15-17, 2000 Proceedings

Editors: Brandes, Ulrik, Wagner, Dorothea (Eds.)

Buy this book

eBook $74.99
price for USA in USD (gross)
  • ISBN 978-3-540-40064-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA in USD
  • ISBN 978-3-540-41183-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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 (28 chapters)

  • On the Expected Runtime and the Success Probability of Evolutionary Algorithms (Invited Presentation)

    Wegener, Ingo

    Pages 1-10

  • n Points and One Line: Analysis of Randomized Games (Abstract of Invited Lecture)

    Welzl, Emo

    Pages 11-12

  • Approximating Call-Scheduling Makespan in All-Optical Networks

    Becchetti, Luca (et al.)

    Pages 13-22

  • New Spectral Lower Bounds on the Bisection Width of Graphs

    Bezrukov, Sergei L. (et al.)

    Pages 23-34

  • Traversing Directed Eulerian Mazes (Extended Abstract)

    Bhatt, Sandeep (et al.)

    Pages 35-46

Buy this book

eBook $74.99
price for USA in USD (gross)
  • ISBN 978-3-540-40064-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA in USD
  • ISBN 978-3-540-41183-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Graph-Theoretic Concepts in Computer Science
Book Subtitle
26th International Workshop, WG 2000 Konstanz, Germany, June 15-17, 2000 Proceedings
Editors
  • Ulrik Brandes
  • Dorothea Wagner
Series Title
Lecture Notes in Computer Science
Series Volume
1928
Copyright
2000
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-40064-6
DOI
10.1007/3-540-40064-8
Softcover ISBN
978-3-540-41183-3
Series ISSN
0302-9743
Edition Number
1
Number of Pages
X, 313
Topics