Skip to main content
SpringerLink
Log in

Relations and Graphs

Discrete Mathematics for Computer Scientists

  • Book
  • © 1993

Overview

Authors:
  1. Gunther Schmidt

    1. Fakultät für Informatik, Universität der Bundeswehr München, Neubiberg, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Thomas Ströhlein

    1. Fakultät für Informatik, Technische Universität München, München 2, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

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

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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 (10 chapters)

  1. Front Matter

    Pages i-ix
    Download chapter PDF

  2. Sets

    • Gunther Schmidt, Thomas Ströhlein
    Pages 1-4

  3. Homogeneous Relations

    • Gunther Schmidt, Thomas Ströhlein
    Pages 5-27

  4. Transitivity

    • Gunther Schmidt, Thomas Ströhlein
    Pages 28-49

  5. Heterogeneous Relations

    • Gunther Schmidt, Thomas Ströhlein
    Pages 50-80

  6. Graphs: Associated Relation, Incidence, Adjacency

    • Gunther Schmidt, Thomas Ströhlein
    Pages 81-104

  7. Reachability

    • Gunther Schmidt, Thomas Ströhlein
    Pages 105-141

  8. The Category of Graphs

    • Gunther Schmidt, Thomas Ströhlein
    Pages 142-171

  9. Kernels and Games

    • Gunther Schmidt, Thomas Ströhlein
    Pages 172-196

  10. Matchings and Coverings

    • Gunther Schmidt, Thomas Ströhlein
    Pages 197-228

  11. Programs: Correctness and Verification

    • Gunther Schmidt, Thomas Ströhlein
    Pages 229-264

  12. Back Matter

    Pages 265-304
    Download chapter PDF
Back to top

Keywords

About this book

Relational methods can be found at various places in computer science, notably in data base theory, relational semantics of concurrency, relationaltype theory, analysis of rewriting systems, and modern programming language design. In addition, they appear in algorithms analysis and in the bulk of discrete mathematics taught to computer scientists. This book is devoted to the background of these methods. It explains how to use relational and graph-theoretic methods systematically in computer science. A powerful formal framework of relational algebra is developed with respect to applications to a diverse range of problem areas. Results are first motivated by practical examples, often visualized by both Boolean 0-1-matrices and graphs, and then derived algebraically.

Authors and Affiliations

  • Fakultät für Informatik, Universität der Bundeswehr München, Neubiberg, Germany

    Gunther Schmidt

  • Fakultät für Informatik, Technische Universität München, München 2, Germany

    Thomas Ströhlein

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation