Structural properties, parameterized tractability and hardness in combinatorial problems

Projekt nespadá pod Filozofickou fakultu, ale pod Fakultu informatiky. Oficiální stránka projektu je na webu muni.cz.

Logo poskytovatele
Kód projektu
GA17-00837S
Období řešení
1/2017 - 12/2019
Investor / Programový rámec / typ projektu
Grantová agentura ČR
Fakulta / Pracoviště MU
Fakulta informatiky

The concept of parameterized tractability allows for guaranteed efficient solutions of some instances - as determined by the parameter, of problems which are intractable in their full generality. Our proposal addresses various questions belonging to theoretical foundations of parameterized algorithmics, namely those related to structural and topological graph theory, and to logic and interpretations in graphs. Among the problems we propose to investigate are algorithmic metatheorems for FO properties on dense graph classes, FO interpretations in sparse classes and their structural characterizations, parameterized tractability of graph crossing number and planar insertion problems, structural characterization of crossing-critical graphs, and other.

Publikace

Počet publikací: 14


Předchozí 1 2 Další