Error-correcting Pooling Designs Constructed From Matchings of a Complete Graph
碩士 === 國立高雄大學 === 應用數學系碩博士班 === 107 === The model of classical group testing is: given n items, at most d of them are defective, we want to find out all of the defectives using the minimum number of tests that are applied on a subset of these items. In a nonadaptive algorithm, also called a poolin...
Main Authors: | CHENG-HUO LU, 呂政和 |
---|---|
Other Authors: | Huilan Chang |
Format: | Others |
Language: | en_US |
Published: |
2018
|
Online Access: | http://ndltd.ncl.edu.tw/handle/a5f225 |
Similar Items
-
Error-correcting pooling designs and group testing for consecutive positives
by: Yi-tsz Tsai, et al.
Published: (2014) -
Construct Pooling Spaces from Distance-Regular Graphs
by: Ming-hsu Tsai, et al.
Published: (2003) -
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs
by: David Schaller, et al.
Published: (2021-03-01) -
Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs
by: Xiaolin Chen, et al.
Published: (2019-01-01) -
Pooling Designs, Distance-regular Graphs, Spectral Graph Theory and Their Links
by: Huang, Yu-Pei, et al.
Published: (2013)