Edge and Pair Queries -- Random Graphs and Complexity
Combinatorics
2023-05-15 v2 Discrete Mathematics
Abstract
We investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
Cite
@article{arxiv.2203.06006,
title = {Edge and Pair Queries -- Random Graphs and Complexity},
author = {Dariusz Dereniowski and Przemysław Gordinowicz and Paweł Prałat},
journal= {arXiv preprint arXiv:2203.06006},
year = {2023}
}
Comments
23 pages