1 citations · 1 across the 3 of their papers we have counts for
3 papers
Efficient and Stable Fully Dynamic Facility Location
Sayan Bhattacharya, Silvio Lattanzi, Nikos Parotsidis
We consider the classic facility location problem in fully dynamic data streams, where elements can be both inserted and deleted. In this problem, one is interested in maintaining…
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…
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…