Ergebnisse für: NP-hartes Problem

This thesis studies the parameterized computational complexity of NP-hard problems that have applications in two areas of network analysis: clustering and querying. In particular, we aim at identifying parameters that describe the complexity of the computational problems and may thus serve as basis ...

The focus of the thesis is on the development of fixed-parameter algorithms for NP-hard problems arising in computational biology. The considered problems model tasks in data clustering, construction of phylogenetic trees, predicting information on the three-dimensional structure of proteins, and ha...