Skip to main content
SpringerLink
Log in

Graphtheoretic Concepts in Computer Science

Proceedings of the International Workshop WG 80 Bad Honnef, June 15-18, 1980

  • Conference proceedings
  • © 1981

Overview

Editors:
  1. Hartmut Noltemeier
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 100)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (30 papers)

  1. Front Matter

    Download chapter PDF

  2. The post-office problem and related questions

    • H. Maurer
    Pages 1-19

  3. Series of graphs generated by rational machines

    • Hidenosuke Nishio
    Pages 20-31

  4. On linearizing graphs

    • Kurt-Ulrich Witt
    Pages 32-41

  5. Set-theoretic concepts in programming languages and their implementation

    • Hans Jürgen Schneider
    Pages 42-54

  6. Graph rewriting and automatic, machine-independent program optimization

    • M. Nagl
    Pages 55-69

  7. Properties of ordered graph grammars

    • Helmut J Ludwigs
    Pages 70-79

  8. The power of a one-dimensional vector of processors

    • Jon Louis Bentley, Thomas Ottmann
    Pages 80-89

  9. A new data structure for representing sorted lists

    • Kurt Mehlhorn
    Pages 90-112

  10. On the use of some almost sure graph properties

    • Gottfried Tinhofer
    Pages 113-126

  11. On a generalization of heaps

    • Hartmut Noltemeier
    Pages 127-136

  12. Graph grammars and the complexity gap in the isomorphism problem for acyclic digraphs

    • M. Schnitzler
    Pages 137-149

  13. Issues in the study of graph embeddings

    • Arnold L. Rosenberg
    Pages 150-176

  14. Schema hypergraphs:A formalism to investigate logical data base design

    • Carlo Batini, Alessandro D'Atri
    Pages 177-194

  15. The use of transitively irreducible kernels of full families of functional dependencies in logical data base design

    • Peter Kandzia, Margret Mangelmann
    Pages 195-211

  16. Graph algorithms for the synthesis and manipulation of data base schemes

    • G. Ausiello, A. D'Atri, D. Sacca'
    Pages 212-233

  17. The analysis of search trees: A survey

    • Th. Ottmann, H. -W. Six, D. Wood
    Pages 234-249

  18. A framework for data structures

    • H. -W. Six
    Pages 250-267

  19. Investigating programs in terms of partial graphs

    • Gunther Schmidt
    Pages 268-269

  20. An observation concerning the complexity of problems with few solutions and its application to cryptography

    • Shimon Even, Yacov Yacobi
    Pages 270-278
Back to top

Keywords

Bibliographic Information

  • Book Title: Graphtheoretic Concepts in Computer Science

  • Book Subtitle: Proceedings of the International Workshop WG 80 Bad Honnef, June 15-18, 1980

  • Editors: Hartmut Noltemeier

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-10291-4

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1981

  • Softcover ISBN: 978-3-540-10291-5Published: 01 February 1981

  • eBook ISBN: 978-3-540-38435-9Published: 05 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XII, 408

  • Topics: Theory of Computation, Computation by Abstract Devices

Publish with us

Policies and ethics

Back to top

Search

Navigation