Showing cs.DSShow all
3 papers · 1 filter
cs.DS2024★ 1 cited
Almost Optimal Fully Dynamic -Center Clustering with Recourse
Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad +2
In this paper, we consider the \emph{metric -center} problem in the fully dynamic setting, where we are given a metric space evolving via a sequence of point insertions…
cs.DS2014
2-Vertex Connectivity in Directed Graphs
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura +1
We complement our study of 2-connectivity in directed graphs, by considering the computation of the following 2-vertex-connectivity relations: We say that two vertices v and w are…
cs.DS2014
2-Edge Connectivity in Directed Graphs
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura +1
Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly not much has been inve…