Distributed Algorithms for Fundamental Graph Problems (DiAloG)

This website collects all activity related to the research project "Distributed Algorithms for Fundamental Graph Problems (DiAloG)". The main objective in this project is to develop faster graph algorithms in the CONGEST model of distributed computing with provable correctness and running time guarantees.

Principal Investigator: Sebastian Forster
Host Institution: University of Salzburg
Funding Agency: Austrian Science Fund (FWF)
Project Number: P 32863-N
Duration: 03/2020 – 02/2024

Currently, there is an open position for a postdoc in this project.

Team Members

Publications

Supported by the Austrian Science Fund (FWF): P 32863-N

Other Files

Back to homepage