Full metadata record
DC FieldValueLanguage
dc.contributor.authorChang, Huilanen_US
dc.contributor.authorFu, Hung-Linen_US
dc.contributor.authorShih, Chih-Huaien_US
dc.date.accessioned2015-07-21T11:21:06Z-
dc.date.available2015-07-21T11:21:06Z-
dc.date.issued2014-12-01en_US
dc.identifier.issn1862-4472en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s11590-014-0751-9en_US
dc.identifier.urihttp://hdl.handle.net/11536/123884-
dc.description.abstractWe 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.en_US
dc.language.isoen_USen_US
dc.subjectCombinatorial searchen_US
dc.subjectGraph learningen_US
dc.subjectCompetitive group testingen_US
dc.subjectComplex modelen_US
dc.titleLearning a hidden graphen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s11590-014-0751-9en_US
dc.identifier.journalOPTIMIZATION LETTERSen_US
dc.citation.spage2341en_US
dc.citation.epage2348en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000345317500015en_US
dc.citation.woscount0en_US
Appears in Collections:Articles


Files in This Item:

  1. 000345317500015.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.