Learning a Hidden Graph Using O(log n) Queries Per Edge.

Dana Angluin, Jiang Chen

Browse the full COLT paper archive.