Ergebnisse für: parameterized algorithmics
Hier findest Du Bücher, die sich mit parameterized algorithmics beschäftigen.
This thesis deals with degree-constrained graph modification problems. In particular, we investigate the computational complexity of DAG Realization and Degree Anonymity. The DAG Realization problem is, given a multiset of positive integer pairs, to decide whether there is a realizing directed acycl...
This book constitutes the thoroughly refereed
post-conference proceedings of the First IFIP WG 1.8 International Conference
on Topics in Theoretical Computer Science, held in Tehran, Iran, in August
2015.
The 10 full papers presented together with 3
invited talks were carefully reviewed and selecte...
This thesis is concerned with analyzing the computational complexity of NP-hard problems related to data science. For most of the problems considered in this thesis, the computational complexity has not been intensively studied before. We focus on the complexity of computing exact problem solutions ...