activity
20052026
most citedPolynomial-time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs

4 citations · 7 across the 9 of their papers we have counts for

collaborators
Showing 2015Show all

1 paper · 1 filter

cs.DS2015★ 3 cited

Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs

Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos +1

Let be a strongly connected directed graph. We consider the following three problems, where we wish to compute the smallest strongly connected spanning subgraph of that mai…