2 citations · 3 across the 2 of their papers we have counts for
4 papers
Cut paths and their remainder structure, with applications
Massimo Cairo, Shahbaz Khan, Romeo Rizzi +3
In a strongly connected graph , a cut arc (also called strong bridge) is an arc whose removal makes the graph no longer strongly connected. Equivalently, there…
The Hydrostructure: a Universal Framework for Safe and Complete Algorithms for Genome Assembly
Massimo Cairo, Shahbaz Khan, Romeo Rizzi +3
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 from…
Safety in - Paths, Trails and Walks
Massimo Cairo, Shahbaz Khan, Romeo Rizzi +2
Given a directed graph and a pair of nodes and , an \emph{- bridge} of is an edge whose removal breaks all - paths of (and thus appears in all -$t…
Computing all - bridges and articulation points simplified
Massimo Cairo, Shahbaz Khan, Romeo Rizzi +3
Given a directed graph and a pair of nodes and , an - bridge of is an edge whose removal breaks all - paths of . Similarly, an - articulation po…