19 citations · 50 across the 4 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017★ 15 cited
Efficiently sampling the realizations of irregular, but linearly bounded bipartite and directed degree sequences
Péter L. Erdős, Tamás Róbert Mezei, István Miklós
Since 1997 a considerable effort has been spent on the study of the swap (switch) Markov chains on graphic degree sequences. Several results were proved on rapidly mixing Markov ch…
math.CO2017
On k-neighbor separated permutations
István Kovács, Daniel Soltész
Two permutations of are \textit{-neighbor separated} if there are two elements that are neighbors in one of the permutations and that are separated by exa…