Table of contents

  1. Front Matter
  2. Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    Pages 1-17
  3. Jürgen Plehn, Bernd Voigt
    Pages 18-29
  4. Hans L. Bodlaender
    Pages 30-40
  5. Ulrich Huckenbeck, Detlev Ruland
    Pages 41-60
  6. Tze-Heng Ma, Jeremy P. Spinrad
    Pages 61-71
  7. Hermann Stamm
    Pages 79-89
  8. Franz Aurenhammer, Johann Hagauer
    Pages 90-98
  9. Kuo-Feng Liao, Majid Sarrafzadeh
    Pages 99-108
  10. Claudio Arbib
    Pages 119-129
  11. Michael Formann, Frank Wagner
    Pages 130-139
  12. Seshu Madhavapeddy, I. Hal Sudborough
    Pages 154-169
  13. Hyeong-Ah Choi, Abdol-Hossein Esfahanian
    Pages 170-181
  14. A. Das, K. Thulasiraman
    Pages 193-205
  15. Ofer Biran, Shlomo Moran, Shmuel Zaks
    Pages 206-220
  16. M. Habib, M. Morvan, J. X. Rampon
    Pages 221-238

About these proceedings

Introduction

This volume gives the proceedings of WG '90, the 16th in a series of workshops. The aim of the workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applications. The volume is organized into sections on: - Graph algorithms and complexity, - VLSI layout, - Multiprocessor systems and concurrency, - Computational geometry, - Graphs, languages and databases, - Graph grammars. The volume contains revised versions of nearly all the papers presented at the workshop. Several papers take the form of preliminary reports on ongoing research.

Keywords

Algorithmus Concurrency Graph theory Graphentheorie Komplexität Parallelität VLSI technology VLSI-Technologie algorithms automata complexity databases geometry logic vertices

Bibliographic information

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