Relations and Graphs: Discrete Mathematics for Computer Scientists

Front Cover
Springer Science & Business Media, Dec 6, 2012 - Computers - 301 pages
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Sets
1
Transitivity
28
Heterogeneous Relations
50
Associated Relation Incidence Adjacency
81
Reachability
105
Table of Contents
142
Kernels and Games
172
Matchings and Coverings
197
Correctness and Verification
229
Appendix
265
Fixedpoint Theorems and Antimorphisms
278
Name Index
291
Copyright

Other editions - View all

Common terms and phrases