Structure of tractable instances of hard algorithmic problems on graphs
- Project Identification
- GA20-04567S
- Project Period
- 1/2020 - 12/2022
- Investor / Pogramme / Project type
-
Czech Science Foundation
- Standard Projects
- MU Faculty or unit
- Faculty of Informatics
One of the fundamental questions in theoretical CS is how to approach problems which are intractable in their full generality. Our proposal is to investigate the internal structure of tractable instances of such generally hard problems on graphs, namely those dealing with structural and topological graph theory, geometric graphs, and of problems definable in various logics. In particular, we propose to investigate algorithmic and complexity theoretical aspects of new width and sparsity parameters of graph classes, properties of geometric representations of graphs, tractable instances for the FO model checking problem, and the detailed structure of the graph crossing number problem.
Publications
Total number of publications: 3
2020
-
Clique-Width of Point Configurations
Graph-Theoretic Concepts in Computer Science, WG 2020, year: 2020
-
Isomorphism Problem for Sd-Graphs
45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), year: 2020
-
On Embeddability of Unit Disk Graphs onto Straight Lines
International Computer Science Symposium in Russia, CSR 2020, year: 2020