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 3 of 3 for “"Trees (Graph theory)"”.

  1. An analytic approach to problems connected with plane tree enumeration

    … structures can be related to a set of plane trees that has eliminated all trees that contain any element of a defined set of forbidden substructures. In computer science, such a set of plane trees can be used to describe lists. The cell growth problem can also be investigated in a similar …

    binghamton Repository record for An analytic approach to problems connected with plane tree enumeration (opens in a new tab)

  2. Topology sensitive algorithms for large scale uncapacitated covering problem

    Solving NP-hard facility location problems in wireless network planning is a common scenario. In our research, we study the Covering problem, a well known facility location problem with applications in wireless network deployment. We focus on networks with a sparse structure. First, we analyzed two …

    lethbridge Repository record for Topology sensitive algorithms for large scale uncapacitated covering problem (opens in a new tab)