Marek Sokołowski gave a talk on a new parallel algorithm computing single-source shortest paths in directed graphs at the Discrete Math Seminar

On February 24, 2026, Marek Sokołowski from the Max Planck Institute of Informatics gave a talk at the Discrete Math Seminar on a new parallel algorithm computing single-source shortests paths in directed graphs. The title of his talk was “Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP“.

IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.