Projects funded by the NCN
Efficient algorithms for finding maximum induced acyclic subgraph in directed graphs
2023/49/N/ST6/02506
Keywords:
maximum induced acyclic subgraph directed feedback vertex set DFVS heuristics large graphs
Descriptors:
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Politechnika Poznańska, Wydział Informatyki i Telekomunikacji
woj. wielkopolskie
Principal investigator (from the host institution):
Number of co-investigators in the project: 2
Call: PRELUDIUM 22 - announced on 2023-03-16
Amount awarded: 152 800 PLN
Project start date (Y-m-d): 2024-03-01
Project end date (Y-m-d): 2027-02-28
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.