|
Dynamic graph algorithms and complexity| old_uid | 17373 |
|---|
| title | Dynamic graph algorithms and complexity |
|---|
| start_date | 2019/02/13 |
|---|
| schedule | 17h |
|---|
| online | no |
|---|
| location_info | Aile Rataud, 2e sous-sol, salle Henri Cartan |
|---|
| summary | In this talk I will attempt to answer the following questions I have been asked quite often: What are the current challenges in dynamic graph algorithms? What are good starting points for people who want to try working in this field? The talk will focus on challenges for basic graph problems (e.g. connectivity, shortest paths, maximum matching), and will survey some existing upper and lower bound results and techniques. |
|---|
| responsibles | <not specified> |
|---|
| |
|