Relations and Graphs: Discrete Mathematics for Computer Scientists (1993) (Monographs in Theoretical Computer Science. An EATCS Series)
By: and
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 1993
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9783642779688
- Related ISBNs:
- 9783540562542
- Publisher:
- Springer Berlin Heidelberg
- Date of Addition:
- 07/20/22
- Copyrighted By:
- N/A
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet, Mathematics and Statistics, Philosophy
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.
Reviews
Other Books
- by Gunther Schmidt
- by Thomas Ströhlein
- in Nonfiction
- in Computers and Internet
- in Mathematics and Statistics
- in Philosophy