Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). Kannan, R., Tetali, P., & Vempala, S. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana, USA., pages 193–200, 1997.
Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract) [link]Paper  bibtex   
@inproceedings{DBLP:conf/soda/KannanTV97,
  author    = {Ravi Kannan and
               Prasad Tetali and
               Santosh Vempala},
  title     = {Simple Markov-Chain Algorithms for Generating Bipartite Graphs and
               Tournaments (Extended Abstract)},
  booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA.}},
  pages     = {193--200},
  year      = {1997},
  crossref  = {DBLP:conf/soda/1997},
  url       = {http://dl.acm.org/citation.cfm?id=314161.314256},
  timestamp = {Thu, 05 Jul 2018 07:29:42 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/KannanTV97},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0