@InProceedings{carstens_et_al:LIPIcs.APPROX-RANDOM.2018.36,
  author =	{Carstens, Corrie Jacobien and Kleer, Pieter},
  title =	{{Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
  pages =	{36:1--36:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-085-9},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{116},
  editor =	{Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.36},
  URN =		{urn:nbn:de:0030-drops-94403},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2018.36},
  annote =	{Keywords: Binary matrix, graph sampling, Curveball, switch, Markov chain decomposition, Johnson graph}
}