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 条
  • [21] Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling
    Aliakbarpour, Maryam
    Biswas, Amartya Shankha
    Gouleakis, Themis
    Peebles, John
    Rubinfeld, Ronitt
    Yodpinyanee, Anak
    ALGORITHMICA, 2018, 80 (02) : 668 - 697
  • [22] Sublinear-time distributed algorithms for detecting small cliques and even cycles
    Eden, Talya
    Fiat, Nimrod
    Fischer, Orr
    Kuhn, Fabian
    Oshman, Rotem
    DISTRIBUTED COMPUTING, 2022, 35 (03) : 207 - 234
  • [23] Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling
    Maryam Aliakbarpour
    Amartya Shankha Biswas
    Themis Gouleakis
    John Peebles
    Ronitt Rubinfeld
    Anak Yodpinyanee
    Algorithmica, 2018, 80 : 668 - 697
  • [24] Sublinear-time distributed algorithms for detecting small cliques and even cycles
    Talya Eden
    Nimrod Fiat
    Orr Fischer
    Fabian Kuhn
    Rotem Oshman
    Distributed Computing, 2022, 35 : 207 - 234
  • [25] Faster Sublinear-Time Edit Distance
    Bringmann, Karl
    Cassis, Alejandro
    Fischer, Nick
    Kociumaka, Tomasz
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 3274 - 3301
  • [26] Sublinear-Time Computation in the Presence of Online Erasures
    Kalemaj I.
    Raskhodnikova S.
    Varma N.
    Theory of Computing, 2023, 19 (01): : 1 - 48
  • [27] A sublinear-time approximation scheme for bin packing
    Batu, Tugkan
    Berenbrink, Petra
    Sohler, Christian
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5082 - 5092
  • [28] Sublinear-time reductions for big data computing
    Gao, Xiangyu
    Li, Jianzhong
    Miao, Dongjing
    THEORETICAL COMPUTER SCIENCE, 2022, 932 : 1 - 12
  • [29] Differentially-Private Sublinear-Time Clustering
    Blocki, Jeremiah
    Grigorescu, Elena
    Mukherjee, Tamalika
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 332 - 337
  • [30] Sublinear-Time Computation in the Presence of Online Erasures
    Kalemaj, Iden
    Raskhodnikova, Sofya
    Varma, Nithin
    THEORY OF COMPUTING, 2023, 19
12345