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 条
  • [31] Sublinear-Time Reductions for Big Data Computing
    Gao, Xiangyu
    Li, Jianzhong
    Miao, Dongjing
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 374 - 388
  • [32] Sublinear-time approximation for clustering via random sampling
    Czumaj, A
    Sohler, C
    AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 396 - 407
  • [33] Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables
    Choi, Bosu
    Iwen, Mark A.
    Krahmer, Felix
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2021, 21 (02) : 275 - 329
  • [34] A SUBLINEAR-TIME RANDOMIZED APPROXIMATION ALGORITHM FOR MATRIX GAMES
    GRIGORIADIS, MD
    KHACHIYAN, LG
    OPERATIONS RESEARCH LETTERS, 1995, 18 (02) : 53 - 58
  • [35] Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables
    Bosu Choi
    Mark A. Iwen
    Felix Krahmer
    Foundations of Computational Mathematics, 2021, 21 : 275 - 329
  • [36] Multiscale Matrix Sampling and Sublinear-Time PageRank Computation
    Borgs, Christian
    Brautbar, Michael
    Chayes, Jennifer
    Teng, Shang-Hua
    INTERNET MATHEMATICS, 2014, 10 (1-2) : 20 - 48
  • [37] A Sublinear-Time Quantum Algorithm for Approximating Partition Functions
    Cornelissen, Arjan
    Hamoudi, Yassine
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 1245 - 1264
  • [38] Sublinear-time approximation of Euclidean minimum spanning tree
    Czumaj, A
    Ergün, F
    Fortnow, L
    Magen, A
    Newman, I
    Rubinfeld, R
    Sohler, C
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 813 - 822
  • [39] Sublinear-Time Mutual Visibility for Fat Oblivious Robots
    Poudel, Pavan
    Sharma, Gokarna
    Aljohani, Aisha
    ICDCN '19: PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING, 2019, : 238 - 247
  • [40] Improved Sublinear-Time Edit Distance for Preprocessed Strings
    Bringmann, Karl
    Cassis, Alejandro
    Fischer, Nick
    Nakos, Vasileios
    Leibniz International Proceedings in Informatics, LIPIcs, 2022, 229
12345