Relations and Graphs: Discrete Mathematics for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series)

Gunther Schmidt, Thomas Strohlein

ISBN 10: 3540562540 / ISBN 13: 9783540562542

Verlag: Springer, 1993

Beschreibung

301 pp., hardcover, NEW!! - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Bestandsnummer des Verkäufers ZB1299232

Bibliografische Details

• Titel: Relations and Graphs: Discrete Mathematics for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series)
• Verlag: Springer
• Erscheinungsjahr: 1993
• Sprache: Englisch
• ISBN-10: 3540562540
• ISBN-13: 9783540562542
• Einband: Hardcover
• Zustand: New

Über diesen Titel

Inhaltsangabe

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.

Reseña del editor

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.