Optimal quantitative group testing on cycles and paths

標題:	Optimal quantitative group testing on cycles and paths
作者:	Hwang, FK Lee, JS 應用數學系 Department of Applied Mathematics
關鍵字:	group testing;search;graph
公開日期:	15-Oct-2001
摘要:	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.
URI:	http://dx.doi.org/10.1016/S0166-218X(01)00188-3 http://hdl.handle.net/11536/29341
ISSN:	0166-218X
DOI:	10.1016/S0166-218X(01)00188-3
期刊:	DISCRETE APPLIED MATHEMATICS
Volume:	113
Issue:	2-3
起始頁:	299
結束頁:	302
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.