research
∙
02/04/2023
On 2-strong connectivity orientations of mixed graphs and related problems
A mixed graph G is a graph that consists of both undirected and directed...
share
research
∙
11/12/2022
On maximal 3-edge-connected subgraphs of undirected graphs
We show how to find and efficiently maintain maximal 3-edge-connected su...
research
∙
08/19/2021
Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph
We present an improved algorithm for computing the 4-edge-connected comp...
research
∙
05/06/2021
Computing the 4-Edge-Connected Components of a Graph in Linear Time
We present the first linear-time algorithm that computes the 4-edge-conn...
research
∙
07/08/2020
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems
A directed graph G=(V,E) is twinless strongly connected if it contains a...
research
∙
07/16/2018
Faster Algorithms for All-Pairs Bounded Min-Cuts
Given a directed graph, the vertex connectivity from u to v is the maxim...
research
∙
02/27/2018
