scientific article
From MaRDI portal
Publication:4023377
zbMath0765.68005MaRDI QIDQ4023377
Gérard D. Cohen, Jean-Pierre Barthelemy, Antoine C. Lobstein
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
État de l'art des méthodes “d'optimisation globale” ⋮ On the number of clusters ⋮ Unnamed Item ⋮ Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. ⋮ On the computation of median linear orders, of median complete preorders and of median weak orders ⋮ Watching systems in graphs: an extension of identifying codes ⋮ On identifying codes in binary Hamming spaces ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ NP-hardness results for the aggregation of linear orders into median orders ⋮ A survey on the complexity of tournament solutions ⋮ On the complexity of Slater's problems ⋮ On the dual distance and the gap of a binary code
