Edge and Pair Queries-Random Graphs and Complexity

Dariusz Dereniowski,Przemyslaw Gordinowicz,Pawel Pralat

arxiv（2023）

引用 0|浏览0

暂无评分

摘要

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.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要