Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Kawahara, Y. (2006). On the cardinality of relations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4136 LNCS, pp. 251–265). Springer Verlag. https://doi.org/10.1007/11828563_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
