Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Gruppentesten"”.
-
Improved upper bounds for several variants of group testing
Group testing is a class of search problems, in which we aim to identify all of n items as either good or defective. We may perform tests on arbitrary subsets, which indicate whether the tested group contains only good items or at least one defective. In the (d,n) and generalized (d,n) group …
-
Group tests on r-ary trees
This thesis deals with group tests on complete and semi-complete r-ary trees. A complete r-ary tree consists of a root, some inner nodes and r^k leaves, where all leaves have the same distance k to the root. A semi-complete r-ary tree is a complete r-ary tree with additional leaves, that have …
-
Edge search in graphs using incidence tests
In this work we consider the $(2,n)$ group testing problem with test sets of cardinality at most $p$. We present sharp upper and lower bounds for the worst case number $c_p(2,n)$ of tests for this group testing problem and show that the maximum difference between the upper and lower bounds is 3. …
-
On combinatorial search problems which involve graphs
Combinatorial search problems are represented as follows: An finite set M is searched for an object x by selecting a subset of a finite set of tests F such that they identify x uniquely. In this thesis 3 types of search problems are treated by solving some special problems involving graphs as …