Learning a hidden graph

檔案

日期

2014-12-01

類型

期刊名稱

OPTIMIZATION LETTERS

卷期與頁次

頁 2341–2348

ISSN

1862-4472

語言

英文

摘要

We 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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chang, H., Fu, H.-L., & Shih, C.-H. (2014). Learning a hidden graph. OPTIMIZATION LETTERS, 2341–2348. https://doi.org/10.1007/s11590-014-0751-9

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/123884