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 “"Kombinatorische Graphentheorie"”.

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

    aachen Repository record for On combinatorial search problems which involve graphs (opens in a new tab)