On the transitive closure of reciprocal [0, 1]-valued relations
From MaRDI portal
Publication:4902468
Recommendations
- Closing reciprocal relations w.r.t. stochastic transitivity
- Opening reciprocal relations w.r.t. stochastic transitivity
- Efficient computation of transitive closures
- Cyclic evaluation of transitivity of reciprocal relations
- An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix
Cited in
(12)- Transitive closure, proximity and intransitivities
- Minimizing cost travel in multimodal transport using advanced relation transitive closure
- Computing transitive closure of bipolar weighted digraphs
- Closing reciprocal relations w.r.t. stochastic transitivity
- Cyclic evaluation of transitivity of reciprocal relations
- Opening reciprocal relations w.r.t. stochastic transitivity
- Maximal and maximum transitive relation contained in a given binary relation
- On the membership problem for the \({0, 1/2}\)-closure
- A fast algorithm for computing transitive relation
- scientific article; zbMATH DE number 3893200 (Why is no real title available?)
- Transitive closures of binary relations. I.
- Transitive closures and orderings on soft sets
This page was built for publication: On the transitive closure of reciprocal \([0, 1]\)-valued relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902468)
