✦ LIBER ✦

Sublinear-time algorithms for tournament graphs

✍ Scribed by Stefan Dantchev; Tom Friedetzky; Lars Nagel

Book ID: 106407370
Publisher: Springer US
Year: 2010
Tongue: English
Weight: 446 KB
Volume: 22
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-010-9325-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sublinear Time Algorithms

✍ Rubinfeld, Ronitt; Shapira, Asaf 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 344 KB

Sublinear Time Algorithms for Earth Move

Sublinear Time Algorithms for Earth Mover’s Distance

✍ Khanh Do Ba; Huy L. Nguyen; Huy N. Nguyen; Ronitt Rubinfeld 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 420 KB

Improved approximation guarantees for su

Improved approximation guarantees for sublinear-time Fourier algorithms

✍ Iwen, Mark A. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Sublinear Geometric Algorithms

✍ Chazelle, Bernard; Liu, Ding; Magen, Avner 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 254 KB

A sublinear-time randomized approximatio

A sublinear-time randomized approximation algorithm for matrix games

✍ Michael D. Grigoriadis; Leonid G. Khachiyan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Simple Markov-chain algorithms for gener

Simple Markov-chain algorithms for generating bipartite graphs and tournaments

✍ Ravi Kannan; Prasad Tetali; Santosh Vempala 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB 👁 2 views

We consider two problems: randomly generating labeled bipartite graphs with a given degree sequence and randomly generating labeled tournaments with a given score sequence. We analyze simple Markov chains for both problems. For the first problem, we cannot prove that our chain is rapidly mixing in g