Developments in Dynamic Graph Algorithms
372
62
Microsoft Research330 тыс
Следующее
06.09.16 – 2 79755:57Популярные
252 дня – 2 5333:17
11.01.23 – 3 6391:22:54Опубликовано 6 сентября 2016, 6:15
In this talk I will survey the latest development in dynamic algorithms for fundamental graph problems, such as shortest paths, reachability and connectivity. In the last five years there were many STOC/FOCS/SODA publications on dynamic graphs. I will overview the most important results in the area and will focus on two results regarding shortest paths which are part of my PhD thesis.
Свежие видео
5 дней – 8 3582:29
9 дней – 1 0415:08
14 дней – 1 645 07721:11
16 дней – 61 8495:35Случайные видео
5 дней – 4492:11
34 дня – 136 6510:14
12.01.23 – 5 884 8120:13
14.03.22 – 37 1350:25
31.07.21 – 241 3119:20
06.04.18 – 2 150 6960:16
5 дней – 1 657 9740:39
8 дней – 8 2461:14
8 дней – 450 1207:43
10 дней – 1 848 99720:03
11 дней – 8 81310:14
16 дней – 1302:31