182 citations · 549 across the 43 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2019
Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results
Günter Rote
A tree with vertices has at most minimal dominating sets. The growth constant is best possible. It is obtained in a semi-automa…
cs.DM2016★ 6 cited
Loopless Gray Code Enumeration and the Tower of Bucharest
Felix Herter, Günter Rote
We give new algorithms for generating all n-tuples over an alphabet of m letters, changing only one letter at a time (Gray codes). These algorithms are based on the connection with…