When you come at the kings you best not miss

09/24/2022
by   Oded Lachish, et al.
0

A tournament is an orientation of a complete graph. We say that a vertex x in a tournament T⃗ controls another vertex y if there exists a directed path of length at most two from x to y. A vertex is called a king if it controls every vertex of the tournament. It is well known that every tournament has a king. We follow Shen, Sheng, and Wu (SIAM J. Comput., 2003) in investigating the query complexity of finding a king, that is, the number of arcs in T⃗ one has to know in order to surely identify at least one vertex as a king. The aforementioned authors showed that one always has to query at least Ω(n^4/3) arcs and provided a strategy that queries at most O(n^3/2). While this upper bound has not yet been improved for the original problem, Biswas et al. (Frontiers in Algorithmics, 2017) proved that with O(n^4/3) queries one can identify a semi-king, meaning a vertex which controls at least half of all vertices. Our contribution is a novel strategy which improves upon the number of controlled vertices: using O(n^4/3polylog n) queries, we can identify a (1/2+2/17)-king. To achieve this goal we use a novel structural result for tournaments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/04/2023

Randomized and quantum query complexities of finding a king in a tournament

A tournament is a complete directed graph. It is well known that every t...
research
01/15/2018

Searching for Maximum Out-Degree Vertices in Tournaments

A vertex x in a tournament T is called a king if for every vertex y of T...
research
03/20/2019

Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets

Suppose that the vertices of a graph G are colored with two colors in an...
research
10/07/2021

Finding popular branchings in vertex-weighted digraphs

Popular matchings have been intensively studied recently as a relaxed co...
research
05/27/2020

Counting graph orientations with no directed triangles

Alon and Yuster proved that the number of orientations of any n-vertex g...
research
04/05/2018

A Framework for Searching in Graphs in the Presence of Errors

We consider two types of searching models, where the goal is to design a...
research
04/30/2020

An Efficient Noisy Binary Search in Graphs via Median Approximation

Consider a generalization of the classical binary search problem in line...

Please sign up or login with your details

Forgot password? Click here to reset