2 papers
cs.DS2022
Undirected -Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms
Václav Rozhoň, Christoph Grunau, Bernhard Haeupler +2
This paper presents near-optimal deterministic parallel and distributed algorithms for computing -approximate single-source shortest paths in any undirected weight…
math.CO2018
A version of the Loebl-Komlós-Sós conjecture for skewed trees
Tereza Klimošová, Diana Piguet, Václav Rozhoň
Loebl, Komlós, and Sós conjectured that any graph with at least half of its vertices of degree at least k contains every tree with at most k edges. We propose a version of this con…