Sublinear-time algorithms for tournament graphs

被引：0
|
作者：
Dantchev, Stefan [1 ]
Friedetzky, Tom [1 ]
Nagel, Lars [1 ]
机构：
[1] Univ Durham, Sch Engn & Comp Sci, Durham DH1 3LE, England
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2011年 / 22卷 / 03期
基金：
英国工程与自然科学研究理事会;
关键词：
Sublinear-time algorithms; Tournament; Random walk;
D O I：
10.1007/s10878-010-9325-7
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O(root nlogn root log*n), that is, sublinear both in the size of the description of the graph as well as in the number of vertices.
引用
收藏
页码：469 / 481
页数：13
相关论文
共 50 条
  • [41] COUNTING STARS AND OTHER SMALL SUBGRAPHS IN SUBLINEAR-TIME
    Gonen, Mira
    Ron, Dana
    Shavitt, Yuval
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (03) : 1365 - 1411
  • [42] Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks
    Le Gall, Francois
    Magniez, Frederic
    PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2018, : 337 - 346
  • [43] High-Rate Codes with Sublinear-Time Decoding
    Kopparty, Swastik
    Saraf, Shubhangi
    Yekhanin, Sergey
    JOURNAL OF THE ACM, 2014, 61 (05)
  • [44] High-Rate Codes with Sublinear-Time Decoding
    Kopparty, Swastik
    Saraf, Shubhangi
    Yekhanin, Sergey
    STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 167 - 176
  • [45] An Adaptive Sublinear-Time Block Sparse Fourier Transform
    Cevher, Volkan
    Kapralov, Michael
    Scarlett, Jonathan
    Zandieh, Amir
    STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 702 - 715
  • [46] SUBLINEAR TIME ALGORITHMS
    Rubinfeld, Ronitt
    Shapira, Asaf
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (04) : 1562 - 1588
  • [47] Improved bounds for a Deterministic sublinear-time Sparse Fourier algorithm
    Iwen, M. A.
    Spencer, C. V.
    2008 42ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-3, 2008, : 458 - 463
  • [48] Approximate Characterization of Multi-Robot Swarm "Shapes" in Sublinear-Time
    Liu, Lantao
    Fine, Benjamin
    Shell, Dylan
    Klappenecker, Andreas
    2011 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2011,
  • [49] A sublinear-time randomized approximation scheme for the robinson-foulds metric
    Pattengale, Nicholas D.
    Moret, Bernard M. E.
    Lect. Notes Comput. Sci., 1600, (221-230):
  • [50] A sublinear-time randomized approximation scheme for the Robinson-Foulds metric
    Pattengale, Nicholas D.
    Moret, Bernard M. E.
    RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY, PROCEEDINGS, 2006, 3909 : 221 - 230
12345