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 2 of 2 for “"Polynomial and approximation algorithms"”.

  1. Scheduling in computer and communication systems and generalized graph coloring problems

    … motivated by scheduling arising in computer and communication systems. The most general problems we attack are called bounded max-vertex/edge-coloring problems and take as input a vertex/edge weighted graph and a bound b. In these problems each color class is of cardinality at most b and of …

    greece Repository record for Scheduling in computer and communication systems and generalized graph coloring problems (opens in a new tab)

  2. Temporal graphs

    … properties of Temporal Graphs, both in general and in specific classes of the model, as well as examine and develop algorithms for solving problems in temporal graph theory. Temporal graphs are graphs that change -often dramatically- as time progresses, however maintaining a fixed number of …

    greece Repository record for Temporal graphs (opens in a new tab)