Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Relations and Graphs : Discrete Mathematics for Computer Scientists, PDF eBook

Relations and Graphs : Discrete Mathematics for Computer Scientists PDF

Part of the Monographs in Theoretical Computer Science. An EATCS Series series

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

Relational methods can be found at various places incomputer science, notably in data base theory, relationalsemantics of concurrency, relationaltype theory, analysisof rewriting systems, and modern programming languagedesign.

In addition, they appear in algorithms analysis andin the bulk of discrete mathematics taught to computerscientists. This book is devoted to the background of these methods.

Itexplains how to use relational and graph-theoretic methodssystematically in computer science. A powerful formal framework of relational algebra isdeveloped with respect to applications to a diverse range ofproblem areas.

Results are first motivated by practicalexamples, often visualized by both Boolean 0-1-matrices andgraphs, and then derived algebraically.

Other Formats

Also in the Monographs in Theoretical Computer Science. An EATCS Series series  |  View all