Title of article
Optimal quantitative group testing on cycles and paths
Author/Authors
F.K. Hwang، نويسنده , , J.S. Lee، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
4
From page
299
To page
302
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.
Keywords
Group testing , Graph , Search
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885280
Link To Document