Title of article :
Optimal quantitative group testing on cycles and paths
Author/Authors :
F.K. Hwang، نويسنده , , J.S. Lee، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
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
Journal title :
Discrete Applied Mathematics
