The following pages link to (Q4023377):
Displaying 12 items.
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- On the complexity of Slater's problems (Q1043351) (← links)
- On the number of clusters (Q1350805) (← links)
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. (Q1401220) (← links)
- On the dual distance and the gap of a binary code (Q1584453) (← links)
- NP-hardness results for the aggregation of linear orders into median orders (Q2271866) (← links)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- (Q2741436) (← links)
- État de l'art des méthodes “d'optimisation globale” (Q4531458) (← links)
