Sökning: "clique partitioning"
Hittade 1 avhandling innehållade orden clique partitioning.
1. Exact and approximation algorithms for graph problems with some biological applications
Sammanfattning : In this thesis we study several combinatorial problems in algorithmic graph theory and computational biology, and different algorithmical approaches for solving them. In particular, we focus on graph algorithms, seeking for the most part polynomial or sub-exponential exact solutions, but in some cases also approximate solutions. LÄS MER
Resultatsidor:
1