Projects funded by the NCN
The graph homomorphism problem in structurally restricted classes
2022/45/N/ST6/00237
Keywords:
graph homomorphism graph coloring computational complexity parameterized complexity diameter
Descriptors:
- ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
- ST1_14: Discrete mathematics and combinatorics
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Politechnika Warszawska
woj. mazowieckie
Principal investigator (from the host institution):
Number of co-investigators in the project: 2
Call: PRELUDIUM 21 - announced on 2022-03-28
Amount awarded: 111 020 PLN
Project start date (Y-m-d): 2023-01-25
Project end date (Y-m-d): 2026-01-24
Project duration:: 36 months (the same as in the proposal)
Project status: Pending project
Project description
Download the project description in a pdf file
Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.