2 citations · 2 across the 1 of their papers we have counts for
3 papers · 1 filter
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…
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…
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
Kathrin Hanauer, Monika Henzinger, Christian Schulz
Given a directed graph and a source vertex, the fully dynamic single-source reachability problem is to maintain the set of vertices that are reachable from the given vertex, subjec…