Add to ORKGAbstract We study the problem of learning a hidden graph by edge-detecting queries, each of which tells whether a set of vertices induces an edge of the hidden graph or not. We provide a new information-theoretic lower bound and give a more efficient adaptive algorithm to learn a general graph with n vertices and m edges in m log n + 10m + 3n edge-detecting queries
Suppose that we are given a set of n elements d of which have a property called defective. A group t...
Abstract. Consider the problem of discovering (or verifying) the edges and non-edges of a network, m...
AbstractWe consider the problem of finding an unknown graph by using queries with an additive proper...
AbstractWe consider the problem of learning a general graph using edge-detecting queries. In this mo...
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the l...
Abstract. We consider the problem of learning and verifying hidden graphs and their properties given...
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a...
We study the problem of learning a hypergraph via edge detecting queries. In this problem, a learner...
Given a partition of a graph into connected components, the membership oracle asserts whether any tw...
We consider the problem of learning the hypergraph using edge-detecting queries. In this model, the ...
AbstractIn this paper, we consider the problem of reconstructing a hidden weighted graph using addit...
Suppose that we are given a set of n elements d of which are defective. A group test can check for a...
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undir...
Consider the following problem: given two nodes s and t in a fully connected graph where each edge o...
An (edge) hidden graph is a graph whose edges are not explicitly given. Detecting the presence of an...
Suppose that we are given a set of n elements d of which have a property called defective. A group t...
Abstract. Consider the problem of discovering (or verifying) the edges and non-edges of a network, m...
AbstractWe consider the problem of finding an unknown graph by using queries with an additive proper...
AbstractWe consider the problem of learning a general graph using edge-detecting queries. In this mo...
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the l...
Abstract. We consider the problem of learning and verifying hidden graphs and their properties given...
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a...
We study the problem of learning a hypergraph via edge detecting queries. In this problem, a learner...
Given a partition of a graph into connected components, the membership oracle asserts whether any tw...
We consider the problem of learning the hypergraph using edge-detecting queries. In this model, the ...
AbstractIn this paper, we consider the problem of reconstructing a hidden weighted graph using addit...
Suppose that we are given a set of n elements d of which are defective. A group test can check for a...
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undir...
Consider the following problem: given two nodes s and t in a fully connected graph where each edge o...
An (edge) hidden graph is a graph whose edges are not explicitly given. Detecting the presence of an...
Suppose that we are given a set of n elements d of which have a property called defective. A group t...
Abstract. Consider the problem of discovering (or verifying) the edges and non-edges of a network, m...
AbstractWe consider the problem of finding an unknown graph by using queries with an additive proper...