AI Chat AI Image Generator AI Video Text to Speech

Edge and Pair Queries – Random Graphs and Complexity

03/11/2022

∙

by Dariusz Dereniowski, et al.

∙

∙

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.

Dariusz Dereniowski
11 publications
Przemysław Gordinowicz
4 publications
Paweł Prałat
19 publications

page 1

page 2

page 3

page 4

research

∙ 12/08/2021

A Simple Algorithm for Graph Reconstruction

How efficiently can we find an unknown graph using distance queries betw...

0 Claire Mathieu, et al. ∙

research

∙ 11/29/2017

Local-Access Generators for Basic Random Graph Models

Consider a computation on a massive random graph: Does one need to gener...

0 Amartya Shankha Biswas, et al. ∙

research

∙ 03/24/2020

Approximate Aggregate Queries Under Additive Inequalities

We consider the problem of evaluating certain types of functional aggreg...

0 Mahmoud Abo Khamis, et al. ∙

research

∙ 10/19/2022

Reducing Graph Parameters by Contractions and Deletions

We consider the following problem: for a given graph G and two integers ...

0 Felicia Lucke, et al. ∙

research

∙ 06/18/2019

Inner Product Oracle can Estimate and Sample

Edge estimation problem in unweighted graphs using local and sometimes g...

0 Arijit Bishnu, et al. ∙

research

∙ 08/03/2022

Common Pairs of Graphs

A graph H is said to be common if the number of monochromatic labelled c...

0 Natalie Behague, et al. ∙

research

∙ 04/05/2018

A Framework for Searching in Graphs in the Presence of Errors

We consider two types of searching models, where the goal is to design a...

0 Dariusz Dereniowski, et al. ∙