1 citations · 1 across the 4 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.IT2022
The Levenshtein's Sequence Reconstruction Problem and the Length of the List
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
In the paper, the Levenshtein's sequence reconstruction problem is considered in the case where at most substitution errors occur in each of the channels and the decoder ou…
math.CO2022★ 1 cited
Super Domination: Graph Classes, Products and Enumeration
Nima Ghanbari, Gerold Jäger, Tuomo Lehtilä
The dominating set problem (DSP) is one of the most famous problems in combinatorial optimization. It is defined as follows. For a given simple graph , a dominating set of…