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 条
  • [1] Sublinear-Time Algorithms for Tournament Graphs
    Dantchev, Stefan
    Friedetzky, Tom
    Nagel, Lars
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2009, 5609 : 459 - 471
  • [2] Sublinear-time algorithms for tournament graphs
    Stefan Dantchev
    Tom Friedetzky
    Lars Nagel
    Journal of Combinatorial Optimization, 2011, 22 : 469 - 481
  • [3] SUBLINEAR-TIME ALGORITHMS
    Woeginger, Gerhard J.
    Czumaj, Artur
    Sohler, Christian
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2006, (89): : 23 - 47
  • [4] Sublinear-time Algorithms
    Czumaj, Artur
    Sohler, Christian
    PROPERTY TESTING: CURRENT RESEARCH AND SURVEYS, 2010, 6390 : 41 - +
  • [5] On derandomizing probabilistic sublinear-time algorithms
    Zimand, Marius
    TWENTY-SECOND ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2007, : 1 - +
  • [6] Combinatorial Sublinear-Time Fourier Algorithms
    M. A. Iwen
    Foundations of Computational Mathematics, 2010, 10 : 303 - 338
  • [7] Combinatorial Sublinear-Time Fourier Algorithms
    Iwen, M. A.
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2010, 10 (03) : 303 - 338
  • [8] Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs
    Lelarge, Marc
    Zhou, Hang
    THEORETICAL COMPUTER SCIENCE, 2014, 548 : 68 - 78
  • [9] Sublinear-Time Clustering Oracle for Signed Graphs
    Neumann, Stefan
    Peng, Pan
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
  • [10] Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs
    Lelarge, Marc
    Zhou, Hang
    ALGORITHMS AND COMPUTATION, 2013, 8283 : 141 - 151
12345