Items related to Relations and Graphs: Discrete Mathematics for Computer...
Relations and Graphs: Discrete Mathematics for Computer Scientists (E A T C S MONOGRAPHS ON THEORETICAL COMPUTER SCIENCE) - Hardcover
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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Relations and Graphs: Discrete Mathematics for Computer...
Seller Image
Relations and Graphs: Discrete Mathematics for Computer Scientists
Published by
Springer-Verlag, Berlin, Heidelberg, New York, et al, 1993
ISBN 10: 0387562540
ISBN 13: 9780387562544
Used
Hardcover
Seller: Munster & Company LLC, ABAA/ILAB, Corvallis, OR, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. Berlin, Heidelberg, New York, et al: Springer-Verlag, 1993. viii, 301 pp. 24 x 16 cm. Semigloss paper covered boards printed silver with black titling to cover and spine. Light horizontal scratch across rear board. Light bumping to spine ends. Interior clean and unmarked. Binding firm. . Hard Cover. Very Good. Seller Inventory # 626622
Quantity: 1 available