Lecture Notes in Computer Science

Graph-Theoretic Concepts in Computer Science

28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers

Editors: Kucera, Ludek (Ed.)

Free Preview

Buy this book

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

The 28th International Workshop on Graph-Theoretic Concepts in Computer ? Science (WG 2002) was held in Cesky ´ Krumlov, a beautiful small town in the southern part of the Czech Republic on the river Vltava (Moldau), June 13–15, 2002. The workshop was organized by the Department of Applied Mathematics of the Faculty of Mathematics and Physics of Charles University in Prague. Since 1975, WG has taken place in Germany 20 times, twice in Austria and The Netherlands, and once in Italy, Slovakia, and Switzerland. As in previous years, the workshop aimed 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 workshop was devoted to the theoretical and practical aspects of graph concepts in computer science, and its contributed talks showed how recent research results from algorithmic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science. Altogether 61 research papers were submitted and reviewed by the program committee. The program committee represented the wide scienti?c spectrum, and in a careful reviewing process with four reports per submission it selected 36papersforpresentationattheworkshop.Thereferees’commentsaswellasthe numerous fruitful discussions during the workshop have been taken into account by the authors of these conference proceedings.

Table of contents (36 chapters)

Table of contents (36 chapters)
  • Maximum Cardinality Search for Computing Minimal Triangulations

    Berry, Anne (et al.)

    Pages 1-12

  • DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem

    Błażewicz, Jacek (et al.)

    Pages 13-24

  • On the Minimum Size of a Contraction-Universal Tree

    Bodini, Olivier

    Pages 25-34

  • Optimal Area Algorithm for Planar Polyline Drawings

    Bonichon, Nicolas (et al.)

    Pages 35-46

  • Cycles in Generalized Networks

    Brandenburg, Franz J.

    Pages 47-56

Buy this book

eBook $89.00
price for USA in USD (gross)
  • ISBN 978-3-540-36379-8
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $119.00
price for USA in USD
  • ISBN 978-3-540-00331-1
  • 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
28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers
Editors
  • Ludek Kucera
Series Title
Lecture Notes in Computer Science
Series Volume
2573
Copyright
2002
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-36379-8
DOI
10.1007/3-540-36379-3
Softcover ISBN
978-3-540-00331-1
Series ISSN
0302-9743
Edition Number
1
Number of Pages
XI, 422
Topics