24 citations · 28 across the 7 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.NI2020★ 1 cited
Compact Oblivious Routing in Weighted Graphs
Philipp Czerner, Harald Räcke
The space-requirement for routing-tables is an important characteristic of routing schemes. For the cost-measure of minimizing the total network load there exist a variety of resul…
cs.DS2020★ 3 cited
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak +1
We introduce a notion for hierarchical graph clustering which we call the expander hierarchy and show a fully dynamic algorithm for maintaining such a hierarchy on a graph with …