activity
20202026
most citedLinear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems

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

collaborators
Showing 2026Show all

1 paper · 1 filter

cs.DS2026

Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time

Loukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas +2

Computing edge-connected components in directed and undirected graphs is a fundamental and well-studied problem in graph algorithms. In a very recent breakthrough, Korhonen [STOC 2…