3 citations · 3 across the 7 of their papers we have counts for
1 paper · 1 filter
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas +1
We show how to find and efficiently maintain maximal k-edge-connected subgraphs in undirected graphs. In particular, we provide the following results. (1) A general framework for m…