Edge and Pair Queries -- Random Graphs and Complexity
Dariusz Dereniowski, Przemys{\l}aw Gordinowicz, Pawe{\l} Pra{\l}at
TL;DR
This paper explores the complexity of two query-based graph parameters on random graphs, demonstrating NP-hardness for bounded degree graphs and analyzing their behavior in binomial random graphs.
Contribution
It introduces the complexity analysis of pair and edge query parameters on random graphs and establishes NP-hardness results for bounded degree cases.
Findings
Determined NP-hardness of parameter computation on bounded degree graphs.
Analyzed the behavior of parameters in binomial random graphs.
Provided complexity insights into graph query problems.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.