36 citations · 216 across the 28 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DM2010★ 5 cited
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance
Péter L. Erdős, Lajos Soukup, Jens Stoye
This paper provides a short and transparent solution for the covering cost of white-grey trees which play a crucial role in the algorithm of Bergeron {\it et al.}\ to compute the r…
math.CO2010★ 1 cited
Towards random uniform sampling of bipartite graphs with given degree sequence
Péter L. Erdös, Istán Miklós, Lajos Soukup
In this paper we consider a simple Markov chain for bipartite graphs with given degree sequence on vertices. We show that the mixing time of this Markov chain is bounded above…