Showing cs.DSShow all
2 papers · 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…
cs.DS2024
On 2-strong connectivity orientations of mixed graphs and related problems
Loukas Georgiadis, Dionysios Kefallinos, Evangelos Kosinas
A mixed graph is a graph that consists of both undirected and directed edges. An orientation of is formed by orienting all the undirected edges of , i.e., converting eac…