10 citations · 74 across the 27 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
Algorithmic counting of nonequivalent compact Huffman codes
Christian Elsholtz, Clemens Heuberger, Daniel Krenn
It is known that the following five counting problems lead to the same integer sequence~: the number of nonequivalent compact Huffman codes of length~ over an alphabet o…
math.CO2019★ 2 cited
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture
Elisabeth Gaar, Daniel Krenn, Susan Margulies +1
Vizing's conjecture (open since 1968) relates the sizes of dominating sets in two graphs to the size of a dominating set in their Cartesian product graph. In this paper, we formula…