Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
An algebraic formalization of fuzzy relations
Fuzzy Sets and Systems
Circulations, Fuzzy Relations and Semirings
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
A Semiring Approach to Equivalences, Bisimulations and Control
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Cardinal Addition in Distributive Allegories
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Using bisimulations for optimality problems in model refinement
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
| Hi-index | 0.00 |
This paper will discuss and characterise the cardinality of boolean (crisp) and fuzzy relations. The main result is a Dedekind inequality for the cardinality, which enables us to manipulate the cardinality of the composites of relations. As applications a few relational proofs for the basic theorems on graph matchings, and fundamentals about network flows will be given.