Optimal quantitative group testing on cycles and paths
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
DOI
10.1016/S0166-218X(01)00188-3
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.