Optimal quantitative group testing on cycles and paths

檔案

日期

2001-10-15

期刊名稱

DISCRETE APPLIED MATHEMATICS

摘要

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.

所屬典藏

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