Sublinear-time algorithms for tournament graphs

Stefan Dantchev, Tom Friedetzky () and Lars Nagel
Additional contact information
Stefan Dantchev: Durham University
Tom Friedetzky: Durham University
Lars Nagel: Durham University

Journal of Combinatorial Optimization, 2011, vol. 22, issue 3, No 12, 469-481

Abstract: Abstract We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time $O(\sqrt{n}\log n\sqrt{\log^{*}n})$ , that is, sublinear both in the size of the description of the graph as well as in the number of vertices.

Keywords: Sublinear-time algorithms; Tournament; Random walk (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-010-9325-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:22:y:2011:i:3:d:10.1007_s10878-010-9325-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-010-9325-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().