2022
DOI: 10.48550/arxiv.2203.06006
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Edge and Pair Queries -- Random Graphs and Complexity

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 N P-hard for bounded degree graphs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 24 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?