Edge and Pair Queries-Random Graphs and Complexity

IF 0.7 4区数学 Q2 MATHEMATICS

Electronic Journal of Combinatorics Pub Date : 2023-06-02 DOI:10.37236/11159

Dariusz Dereniowski, Przemysław Gordinowicz, Paweł Prałat

引用次数: 0

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.

查看原文本刊更多论文

边和对查询-随机图和复杂性

我们研究了图上的两种查询游戏，配对查询和边缘查询。我们集中研究了二项随机图的两个关联图参数，并证明了对于有界度图，确定这两个参数中的任何一个都是np困难的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Electronic Journal of Combinatorics 数学-数学

CiteScore

1.30

自引率

14.30%

发文量

212

审稿时长

3-6 weeks

期刊介绍： The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems.