Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries

Thatchaphol Saranurak
Thatchaphol Saranurak
Sorrachai Yingchareonthawornchai
Sorrachai Yingchareonthawornchai

arXiv: Data Structures and Algorithms, 2019.

Cited by: 0|Bibtex|Views10|Links
EI

Abstract:

We present a new, simple, algorithm for the local vertex connectivity problem (LocalVC) introduced by Nanongkai~et~al. [STOC'19]. Roughly, given an undirected unweighted graph $G$, a seed vertex $x$, a target volume $\nu$, and a target separator size $k$, the goal of LocalVC is to remove $k$ vertices `near' $x$ (in terms of $\nu$) to di...More

Code:

Data:

Your rating :
0

 

Tags
Comments