Optimal quantitative group testing on cycles and paths
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
302 | en_US |
dc.citation.issue |
2-3 | en_US |
dc.citation.spage |
299 | en_US |
dc.citation.volume |
113 | en_US |
dc.citation.woscount |
0 | |
dc.contributor.author |
Hwang, FK | en_US |
dc.contributor.author |
Lee, JS | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:43:20Z | |
dc.date.available |
2014-12-08T15:43:20Z | |
dc.date.issued |
2001-10-15 | en_US |
dc.description.abstract |
We determine the minimum number of group tests required to search for a special edge when the graph consists of cycles and paths, generalizing previous results of Aigner on paths and on a simple cycle. (C) 2001 Elsevier Science B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/S0166-218X(01)00188-3 | en_US |
dc.identifier.issn |
0166-218X | en_US |
dc.identifier.journal |
DISCRETE APPLIED MATHEMATICS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/S0166-218X(01)00188-3 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/29341 | |
dc.identifier.wosnumber |
WOS:000171676900015 | |
dc.language.iso |
en_US | en_US |
dc.subject |
group testing | en_US |
dc.subject |
search | en_US |
dc.subject |
graph | en_US |
dc.title |
Optimal quantitative group testing on cycles and paths | en_US |
dc.type |
Article | en_US |
檔案
- 000171676900015.pdf (62.6 KB, Adobe PDF)
所屬典藏: 期刊論文