6 citations · 12 across the 4 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2021★ 1 cited
Isomorphic unordered labeled trees up to substitution ciphering
Florian Ingels, Romain Azaïs
Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the…
cs.DM2020★ 6 cited
Enumeration of Irredundant Forests
Florian Ingels, Romain Azaïs
Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has alr…