Let G be a directed graph with m edges and n vertices. We present a deterministic linear-
time algorithm for computing the 3-edge-connected components of G. This is a significant …

We present an Õ (m 3/2) time randomized (Monte Carlo) algorithm for computing the 3-edge-
connected components of a digraph with m edges and n vertices. This constitutes the first …

In a strongly connected graph $ G=(V, E) $, a cut arc (also called strong bridge) is an arc $
e\in E $ whose removal makes the graph no longer strongly connected. Equivalently, there …

Let G be a directed multi-graph on n vertices and m edges with a designated source vertex s
and a designated sink vertex t. We study the (s, t)-cuts of capacity minimum+ 1 and as an …

Despite the long history of genome assembly research, there remains a large gap between
the theoretical and practical work. There is practical software with little theoretical …

Genome assembly is a fundamental problem in Bioinformatics, requiring to reconstruct a
source genome from an assembly graph built from a set of reads (short strings sequenced …

Genome assembly asks to reconstruct an unknown string from many shorter substrings of it.
Even though it is one of the key problems in Bioinformatics, it is generally lacking major …

In this paper, we consider the question of computing sparse subgraphs for any input directed
graph $ G=(V, E) $ on $ n $ vertices and $ m $ edges, that preserves reachability and/or …

Abstract The Critical Node Detection Problem (CNDP) consists in finding the set of nodes,
defined critical, whose removal maximally degrades the graph. In this work we focus on …

Let G be a directed graph with n vertices, m edges, and a designated source vertex s. We
address the problem of single-source reachability (SSR) from s in the presence of failures of …