Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, May 25, 2023, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Goran Zuzic (Google Research)

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances

Single-source shortest path computations are important building blocks for many algorithm like maximum flows, graph embeddings, clusterings, etc. However, these higher-level application assume the shortest-path computation is exact and relaxing this condition typically breaks the application. On the other hand, computing exact shortest paths in parallel and distributed settings seems significantly more complicated than their approximate counterparts.

We introduce stronger notions of approximate single-source shortest-path distances. We show how to efficiently compute them from weaker standard notions, and demonstrate the algorithmic power of these new notions and transformations. One application is the first work-efficient parallel algorithm (i.e., that uses O~(m) work) for computing exact single-source shortest paths graphs with strictly sublinear depth --- resolving a major open problem in parallel computing.

Joint work with Václav Rozhoň, Bernhard Haeupler, Anders Martinsson, and Christoph Grunau.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login