Geodesic

Tome 27 (2020) no. 2

Sommaire

Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space
p. 5-16
A graph-theoretical method for decoding some group MLD-codes
p. 17-42
A hybrid local search algorithm for consistent periodic vehicle routing problem
p. 43-64
NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
p. 65-89
On the König graphs for a 5-path and its spanning supergraphs
p. 90-116
Exact formula for exponents of mixing digraphs for register transformations
p. 117-135