An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Florian Barth, Stefan Funke, Claudius Proissl. An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions. In Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, editors, 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany. Volume 244 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

This author has not been identified. Look up 'Florian Barth' in GoogleThis author has not been identified. Look up 'Stefan Funke' in GoogleThis author has not been identified. Look up 'Claudius Proissl' in Google

runs on WebDSL