1 paper
Younjin Kim, Mohit Kumbhat, Zoltan Lorant Nagy +3
Given a graph G and a positive integer R we address the following combinatorial search theoretic problem: What is the minimum number of queries of the form "does an unknown ver…