ENGLISH

Relations and Graphs: Discrete Mathematics for Computer Scientists

By Gunther Schmidt , Thomas Ströhlein

Book information

Publisher
Springer
Year
1993
ISBN
978-3-642-77970-1, 978-3-642-77968-8
DOI
10.1007/978-3-642-77968-8
Language
english
Format
PDF
Filesize
14 MB (14991605 bytes)
Series
EATCS Monographs on Theoretical Computer Science
Pages
311\311
Orientation
portrait
Paginated
yes
Scanned
yes
Time added
2013-08-01 04:00:00
Logic Design; Combinatorics; Logics and Meanings o

Description

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.

Similar books