Projects funded by the NCN
Structural and algorithmic properties of hereditary graph classes
2022/46/E/ST6/00143
Keywords:
Maximum Independent Set problem hereditary graph classes Erdos-Hajnal conjecture chi-boundedness
Descriptors:
- 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 :
Uniwersytet Warszawski, Wydział Matematyki, Informatyki i Mechaniki
woj. mazowieckie
Principal investigator (from the host institution):
Number of co-investigators in the project: 4
Call: SONATA BIS 12 - announced on 2022-05-15
Amount awarded: 1 845 300 PLN
Project start date (Y-m-d): 2023-07-03
Project end date (Y-m-d): 2028-07-02
Project duration:: 60 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.