195 citations · 205 across the 7 of their papers we have counts for
3 papers · 1 filter
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
Sebastian Forster, Danupon Nanongkai, Thatchaphol Saranurak +2
Consider the following "local" cut-detection problem in a directed graph: We are given a seed vertex and need to remove at most edges so that at most edges can be reach…
A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems
Sebastian Forster, Liu Yang
Consider the following "local" cut-detection problem in a directed graph: We are given a starting vertex and need to detect whether there is a cut with at most edges crossi…
Risk-Averse Matchings over Uncertain Graph Databases
Charalampos E. Tsourakakis, Shreyas Sekar, Johnson Lam +1
A large number of applications such as querying sensor networks, and analyzing protein-protein interaction (PPI) networks, rely on mining uncertain graph and hypergraph databases.…