7 citations · 7 across the 1 of their papers we have counts for
1 paper · 2 filters
Evripidis Bampis, Christoph Dürr, Thomas Erlebach +3
Given a hypergraph with uncertain node weights following known probability distributions, we study the problem of querying as few nodes as possible until the identity of a node wit…