Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms

Sebastian Forster
Sebastian Forster
Thatchaphol Saranurak
Thatchaphol Saranurak
Liu Yang
Liu Yang
Sorrachai Yingchareonthawornchai
Sorrachai Yingchareonthawornchai

symposium on discrete algorithms, pp. 2046-2065, 2020.

Cited by: 0|Bibtex|Views4|Links

Abstract:

Consider the following "local" cut-detection problem in a directed graph: We are given a seed vertex $x$ and need to remove at most $k$ edges so that at most $\nu$ edges can be reached from $x$ (a "local" cut) or output $\bot$ to indicate that no such cut exists. If we are given query access to the input graph, then this problem can in ...More

Code:

Data:

Your rating :
0

 

Tags
Comments