Projects funded by the NCN
Parallel and exact algorithms for path problems in directed graphs
2022/47/D/ST6/02184
Keywords:
graph algorithms directed graphs parallel computing reachability shortest paths maximum flow exact computation
Descriptors:
- ST6_006:
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
IDEAS NCBR Sp. z o.o.
woj. mazowieckie
Principal investigator (from the host institution):
Number of co-investigators in the project: 4
Call: SONATA 18 - announced on 2022-07-15
Amount awarded: 580 650 PLN
Project start date (Y-m-d): 2023-08-04
Project end date (Y-m-d): 2026-08-03
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.
Information in the final report
- Articles in post-conference publications (2)
- Max s, t-Flow Oracles and Negative Cycle Detection in Planar DigraphsAuthors:Adam KarczmarzConference:Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms (SODA) (rok: 2024, tom: SODA 2024, strony: 1606--1620), Wydawca: SIAMData:konferencja 7-10/01/2024Status:PublishedDOI:10.1137/1.9781611977912.64 - link to the publication
- Fully Dynamic Strongly Connected Components in Planar DigraphsAuthors:Adam Karczmarz, Marcin SmulewiczConference:51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) (rok: 2024, tom: ICALP 2024, strony: 95:1--95:20), Wydawca: Schloss Dagstuhl – Leibniz-Zentrum für InformatikData:konferencja 8-12/07/2024Status:PublishedDOI:10.4230/LIPIcs.ICALP.2024.95 - link to the publication