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.
Authors
- prof. dr hab. inż. Dariusz Dereniowski link open in new tab ,
- Przemysław Gordinowicz,
- Paweł Prałat
Additional information
- DOI
- Digital Object Identifier link open in new tab 10.37236/11159
- Category
- Publikacja w czasopiśmie
- Type
- artykuły w czasopismach
- Language
- angielski
- Publication year
- 2023
