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 1 of 1 for “"Sequentielle Suche"”.

  1. 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. …

    aachen Repository record for Edge search in graphs using incidence tests (opens in a new tab)