The following pages link to (Q3339952):
Displaying 8 items.
- An efficient algorithm for computing the distance between close partitions (Q617900) (← links)
- Efficient and binary consensus functions on transitively valued relations (Q1059534) (← links)
- The median procedure in cluster analysis and social choice theory (Q1164937) (← links)
- Medians for weight metrics in the covering graphs of semilattices (Q1327234) (← links)
- (Q2750810) (← links)
- (Q3322995) (← links)
- Application of the “descent with mutations” metaheuristic to a clique partitioning problem (Q5242283) (← links)
- Bootstrap clustering for graph partitioning (Q5388153) (← links)
