Pages that link to "Item:Q5951773"
From MaRDI portal
The following pages link to An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix (Q5951773):
Displaying 18 items.
- Fuzzy relational inequalities and equations, fuzzy quasi-orders, closures and openings of fuzzy sets (Q277558) (← links)
- An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph (Q294772) (← links)
- Algorithms for computing the optimal transitive approximation of a proximity relation (Q422457) (← links)
- Formal concept analysis based on fuzzy granularity base for different granulations (Q695251) (← links)
- An application of fuzzy hypergraphs and hypergraphs in granular computing (Q781861) (← links)
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations (Q812624) (← links)
- The structural clustering and analysis of metric based on granular space (Q991254) (← links)
- Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation (Q996435) (← links)
- Computing a T-transitive lower approximation or opening of a proximity relation (Q1038009) (← links)
- Optimization methods for fuzzy clustering (Q1291518) (← links)
- An algorithm for computing the transitive closure of a fuzzy similarity matrix (Q1311751) (← links)
- Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. (Q1428064) (← links)
- Minimizing cost travel in multimodal transport using advanced relation transitive closure (Q1738983) (← links)
- Equivalent bipolar fuzzy relations (Q2269187) (← links)
- Reduction method based on a new fuzzy rough set in fuzzy information system and its applications to scheduling problems (Q2475925) (← links)
- An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity (Q2853332) (← links)
- (Q4209442) (← links)
- On fuzzy preference relation in group decision making (Q4653717) (← links)
