Learning a hidden graph using O (log n) queries per edge

Journal of Computer and System Sciences

Volumn 74, Issue 4, 2008, Pages 546-556

  Angluin, Dana ^a   Chen, Jiang ^b  

^a YALE UNIVERSITY   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Chemical reaction networks; Edge detecting queries; Graphs; Hypergraphs; Monotone DNF formulas; Query learning

Indexed keywords

ALGORITHMS; EDGE DETECTION; HAMILTONIANS; MATHEMATICAL MODELS; QUERY PROCESSING;

CHEMICAL REACTION NETWORKS; EDGE-DETECTING QUERIES; HYPERGRAPHS; MONOTONE DNF FORMULAS; QUERY LEARNING;

GRAPH THEORY;

EID: 42649146264     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2007.06.006     Document Type: Article

References (8)