10 citations · 24 across the 9 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
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…
cs.DS2020
Faster Fully Dynamic Transitive Closure in Practice
Kathrin Hanauer, Monika Henzinger, Christian Schulz
The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence…