Data Structures and Algorithms for Relations
Relational Algebra
Relation Characteristic Functions
Relation-Based Choices
Relation Equivalence Classes
Transitive and Reflexive Closure
Connected components
Consensus Relations
Covering Relations
Dissimilarity Between Relations
Relation Domain, Arity, and Size
Elements of Relation Domains
Relation Ensembles
Relation Graph
Impute relations
Relation Incidences
Prototype-Based Partitions of Relations
Visualize Relations
Relation Predicates
Relation Properties
Rankings
Transitive and Reflexive Reduction
Relations
Relation Scores
Modify Relations
SVM Benchmarking Data and Consensus Relations
Relation Table
Traces of Endorelations
Transform incidences
Violations of Relation Properties
Data structures and algorithms for k-ary relations with arbitrary domains, featuring relational algebra, predicate functions, and fitters for consensus relations.