The following pages link to (Q3026074):
Displaying 4 items.
- Enumeration of the partitions with minimum diameter (Q686476) (← links)
- Computing a T-transitive lower approximation or opening of a proximity relation (Q1038009) (← links)
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion (Q1176597) (← links)
- Structure of transitive valued binary relations (Q1377479) (← links)
