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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have