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 tournament contains at least one vertex v such that every other vertex is reachable from v by a path of length at most 2. All such vertices v are called *kings* of the underlying tournament. Despite active recent research in the...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2023-08
Hauptverfasser:	Mande, Nikhil S, Paraashar, Manaswi, Saurabh, Nitin
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Graph theory Lower bounds Queries Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!