Advertisement

Table of contents

  1. Front Matter
  2. Hidenosuke Nishio
    Pages 20-31
  3. Kurt-Ulrich Witt
    Pages 32-41
  4. Helmut J Ludwigs
    Pages 70-79
  5. Jon Louis Bentley, Thomas Ottmann
    Pages 80-89
  6. Gottfried Tinhofer
    Pages 113-126
  7. Hartmut Noltemeier
    Pages 127-136
  8. Arnold L. Rosenberg
    Pages 150-176
  9. Carlo Batini, Alessandro D'Atri
    Pages 177-194
  10. G. Ausiello, A. D'Atri, D. Sacca'
    Pages 212-233
  11. Th. Ottmann, H. -W. Six, D. Wood
    Pages 234-249
  12. H. -W. Six
    Pages 250-267
  13. Burkhard Monien, Ivan Hal Sudborough
    Pages 279-292
  14. Hans-Jörg Kreowski
    Pages 306-317
  15. Jürgen Ebert, Jürgen Perl
    Pages 326-334
  16. Bernd Mahr
    Pages 335-353
  17. Peter Brucker
    Pages 354-366
  18. Oliver Vornberger
    Pages 367-378
  19. Horst Hamacher
    Pages 383-387

About these proceedings

Keywords

Computer Graph Hypergraph Matching algorithm algorithms complexity computer science cryptography data structure data structures optimization programming programming language

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-10291-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 1981
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-10291-5
  • Online ISBN 978-3-540-38435-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications