10 citations · 10 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022★ 10 cited
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies
Kathrin Hanauer, Monika Henzinger, Stefan Schmid +1
Reconfigurable optical topologies promise to improve the performance in datacenters by dynamically optimizing the physical network in a demand-aware manner. State-of-the-art optica…
cs.DS2020
O'Reach: Even Faster Reachability in Large Graphs
Kathrin Hanauer, Christian Schulz, Jonathan Trummer
One of the most fundamental problems in computer science is the reachability problem: Given a directed graph and two vertices s and t, can s reach t via a path? We revisit existing…