Table of contents

  1. Front Matter
  2. Helmut Alt, Ulrich Fuchs, Klaus Kriegel
    Pages 15-24
  3. Luitpold Babel, Stephan Olariu
    Pages 25-37
  4. Luitpold Babel, Gerhard J. Woeginger
    Pages 38-51
  5. Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
    Pages 52-64
  6. Karell Bertet, Jens Gustedt, Michel Morvan
    Pages 65-77
  7. Alberto Bertoni, Paola Campadelli, Roberto Posenato
    Pages 78-84
  8. Ulrik Brandes, Dagmar Handke
    Pages 85-99
  9. H. J. Broersma, E. Dahlhaus, T. Kloks
    Pages 109-117
  10. Christian Capelle
    Pages 118-131
  11. Fabrizio d'Amore, Fabio Iacobini
    Pages 144-156
  12. Babette de Fluiter, Hans L. Bodlaender
    Pages 157-170
  13. Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks
    Pages 171-183
  14. Thomas Erlebach, Klaus Jansen
    Pages 199-213
  15. Petr Hliněný, Jan Kratochvíl
    Pages 214-228

About these proceedings

Introduction

This book constitutes the strictly refereed post-workshop proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'97, held in Berlin, Germany in June 1997.
The volume presents 28 revised full papers carefully selected for inclusion in the book from 42 submissions. The papers address a variety of graph-theoretic issues relevant from the computer science point of view such as graph algorithms, cycles, graph decompositions, interconnection networks, local search, graph orderings, graph matching, graph languages, tree-width computation, etc.

Keywords

Algorithms Graph Matching Sim algorithm complexity computer computer science programming sets

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0024481
  • Copyright Information Springer-Verlag 1997
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-63757-8
  • Online ISBN 978-3-540-69643-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book