Advertisement

Table of contents

  1. Front Matter
  2. Norbert Korte, Rolf H. Möhring
    Pages 1-16
  3. Manfred Jackel
    Pages 41-57
  4. M. Dao, M. Habib, J. P. Richard, D. Tallot
    Pages 58-67
  5. Hans Zierer, Gunther Schmidt, Rudolf Berghammer
    Pages 68-81
  6. Ulrich Faigle, Gerhard Gierz
    Pages 94-105
  7. Rolf Klein, Derick Wood
    Pages 106-117
  8. S. Abramowski, H. Müller
    Pages 118-130
  9. Ramesh Dewangan, C. Pandu Rangan
    Pages 131-145
  10. Manfred Wiegers
    Pages 165-176
  11. David Helmbold, Ernst Mayr
    Pages 188-203
  12. A. A. Schoone, H. L. Bodlaender, J. van Leeuwen
    Pages 227-236
  13. Frank Dehne, Jörg-Rüdiger Sack
    Pages 237-251
  14. Roberto Tamassia, Ioannis G. Tollis
    Pages 252-263
  15. G.Di Battista, E. Nardelli
    Pages 277-289
  16. Back Matter

About these proceedings

Introduction

Graph-theoretic concepts are developed by computer scientists in order to model algorithms, nets, rewriting systems, distributed systems, parallelism, geometric and layout concepts. Their complexity is studied under various randomness assumptions. This volume contains contributions to the twelfth of a series of annual workshops designed to bring together researchers using graph-theoretic methods. Its purpose is to broadcast emerging new developments from and to a diversity of application fields. The topics covered include: Graph Grammars, Graph Manipulation, Nets, Complexity Issues, Algorithmic and Network Considerations, Outerplanar Graphs, Graph Isomorphism, Parallelism and Distributed Systems, Graphs and Geometry, Randomness Considerations, Applications in Chemistry, Specific Algorithms. N

Keywords

Algorithms Graph Node Sim algorithm complexity data model distributed systems petri net sets

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-17218-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 1987
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-17218-5
  • Online ISBN 978-3-540-47415-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site