1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2016
Sampling bipartite graphs with given vertex degrees and fixed edges and non-edges
Annabell Berger
We consider the problem of sampling a bipartite graph with given vertex degrees where a set of edges and non-edges which need to be contained is predefined. Our general result…
cs.DM2014
Broder's Chain Is Not Rapidly Mixing
Annabell Berger, Steffen Rechner
We prove that Broder's Markov chain for approximate sampling near-perfect and perfect matchings is not rapidly mixing for Hamiltonian, regular, threshold and planar bipartite graph…
cs.DS2012★ 1 cited
How to Attack the NP-complete Dag Realization Problem in Practice
Annabell Berger, Matthias Müller-Hannemann
We study the following fundamental realization problem of directed acyclic graphs (dags). Given a sequence S:=(a_1,b_1),...,(a_n, b_n) with a_i, b_i in Z_0^+, does there exist a da…