Relations and Graphs - Discrete Mathematics for Computer Scientists (Paperback, Softcover reprint of the original 1st ed. 1993)

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.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Monographs in Theoretical Computer Science. An EATCS Series
Release date:	2012
First published:	1993
Authors:	Gunther Schmidt • Thomas Stroehlein
Dimensions:	235 x 155 x 17mm (L x W x T)
Format:	Paperback
Pages:	301
Edition:	Softcover reprint of the original 1st ed. 1993
ISBN-13:	978-3-642-77970-1
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > Computer programming > Software engineering Books > Science & Mathematics > Mathematics > Mathematical foundations > General Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > General Books > Computing & IT > Applications of computing > Artificial intelligence > General
LSN:	3-642-77970-0
Barcode:	9783642779701

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!