## Relations and Graphs: Discrete Mathematics for Computer ScientistsRelational 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.

### Other editions - View all

Relations and Graphs: Discrete Mathematics for Computer Scientists Gunther Schmidt,Thomas Ströhlein No preview available - 2012 |

Relations and Graphs: Discrete Mathematics for Computer Scientists Gunther Schmidt,Thomas Ströhlein No preview available - 1993 |

### Common terms and phrases

1-graph absorbant set adjacency arcs arrows associated relation bipartitioned graph Boolean lattice called circuits complement complete lattice condition confluence consider contains Corollary covering defined Definition directed graphs edge-adjacency edge-connecting element equivalence relation example exists finite graph fixedpoint flowgraph following holds functional given graph G Hasse diagram homogeneous relation homomorphism hyperedge hypergraph incidence inclusion infimum injective intersection irreflexive isomorphism isotonic iteration kernel lub(t matrix move obtain operations ordering pair path of infinite player point axiom point set position postcondition precisely predecessor predicate program steps progressively bounded progressively finite Proof Prop Proposition prove reachability reflexive relation algebra relation-algebraic respect rooted graph rooted tree satisfies Schröder Sect sequence simple graph starting strict-ordering strongly connected components subset successor supremum surjective symmetric syq(A terminal points theorem total correctness transitive closure ubd(t univalent univalent relations unp(R upper bound vector