Relations and graphs : discrete mathematics for computer scientists
Author(s)
Bibliographic Information
Relations and graphs : discrete mathematics for computer scientists
（EATCS monographs on theoretical computer science）
Springer-Verlag, c1993
- : gw
- : us
Available at / 47 libraries
-
Science and Technology Library, Kyushu University
068222193003765,
: gw007.1/Sc 5026211998001277 -
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
: gw004.01/SCH532070354613
-
No Libraries matched.
- Remove all filters.
Note
"Improved, extended and translated (in cooperation with Tilmann Würfel) from the German version Relationen und Graphen (ISBN 3-540-50304-8) which appeared in 1989 in the Springer series Mathematik für Informatiker, edited by F.L. Bauer"--T.p. verso
Includes bibliographical references and indexes
Description and Table of Contents
Description
Relational methods can be found at various places in computer science, notably in data base theory, relational semantics on concurrency, relational type 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 is the first to explain how to use relational and graph-theoretic methods systematically in computer science. A 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 O-1 matrices and graphs, and then derived algebraically.
by "Nielsen BookData"