Distributed and Dynamic Graph Algorithms and Complexity
Sector: Commercial • Location: Denmark, Sweden
Source: EU Funding & Tenders Portal
This project aims to (i) resolve challenging graph problems in distributed and dynamic settings, with a focus on connectivity problems (such as computing edge connectivity and distances), and (ii) on the way develop a systematic approach to attack problems in these settings, by thoroughly exploring relevant algorithmic and complexity-theoretic landscapes. Tasks include - building a hierarchy of in
- Status
- Closed
- Sector
- Commercial
- Location
- Denmark
- Updated
- 22 Jul 2026
- Source
- EU Funding & Tenders Portal
ConstructChat
Ask ConstructChat about Distributed and Dynamic Graph Algorithms and Complexity
Pick a question to edit it, or write your own.
First answer free · no account
Project Information FAQ
Project Information
Participants
| Not available for this record. |
Status
Original status | ended |
Taiyo status | Closed |
Taiyo last update | 2026-07-22 |
Contact
| Not available for this record. |
Description
Description | This project aims to (i) resolve challenging graph problems in distributed and dynamic settings, with a focus on connectivity problems (such as computing edge connectivity and distances), and (ii) on the way develop a systematic approach to attack problems in these settings, by thoroughly exploring relevant algorithmic and complexity-theoretic landscapes. Tasks include - building a hierarchy of intermediate computational models so that designing algorithms and proving lower bounds can be done in several intermediate steps, - explaining the limits of algorithms by proving conditional lower bounds based on old and new reasonable conjectures, and - connecting techniques in the two settings to generate new insights that are unlikely to emerge from the isolated viewpoint of a single field. The project will take advantage from and contribute to the developments in many young fields in theoretical computer science, such as fine-grained complexity and sublinear algorithms. Resolving one of the connectivity problems will already be a groundbreaking result. However, given the approach, it is likely that one breakthrough will lead to many others. |
Location
Country | Denmark |
Source
Source | EU Funding & Tenders Portal |
URL |
More Details
Record type | Project |
Sector | Commercial |
Article published date | 2026-01-15 |
Research
Free account
View all details
You are reading the public part. A free account opens the rest:
- Every detail on this project
- News and media coverage
- Technical research
Free account · no card · lands you back on this project
