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\left(\sqrt{n} \cdot \log n \cdot \sqrt{\log^{*}n}\right)\), that is, sublinear both in the size of the description of the graph as well as in the number of vertices. This result is motivated by the search of a generic algorithm for solving a large class of search problems called Local Search, LS. LS is defined by us as a generalisation of the well-known class PLS.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Camion, P.: Chemins et circuits hamiltoniens dans les graphes complets. Comptes Rendus de la Académie des Sciences de Paris 249, 2151–2152 (1959)
Czumaj, A., Sohler, C.: Sublinear-time Algorithms. Bulletin of the EATCS 89, 23–47 (2006)
Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How Easy is Local Search? J. Comput. Syst. Sci. 37(1), 79–100 (1988)
Moon, J.W.: Topics on Tournaments. Holt, Rinehart, and Winston, New York (1968)
Reid, K.B., Beineke, L.W.: Tournaments. In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory, pp. 169–204. Academic Press, London (1978)
Rubinfeld, R.: Sublinear time algorithms (2006), http://people.csail.mit.edu/ronitt/pa-pers/index.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dantchev, S., Friedetzky, T., Nagel, L. (2009). Sublinear-Time Algorithms for Tournament Graphs. In: Ngo, H.Q. (eds) Computing and Combinatorics. COCOON 2009. Lecture Notes in Computer Science, vol 5609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02882-3_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-02882-3_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02881-6
Online ISBN: 978-3-642-02882-3
eBook Packages: Computer ScienceComputer Science (R0)