Massimo Cairo

activity

20202022

s

t

bridges and articulation points simplified

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2022

Minimum Path Cover in Parameterized Linear Time

Manuel Caceres, Massimo Cairo, Brendan Mumey +2

A minimum path cover (MPC) of a directed acyclic graph (DAG) $G = (V, E)$ is a minimum-size set of paths that together cover all the vertices of the DAG. Computing an MPC is a basic…

cs.DS2021

Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time

Manuel Cáceres, Massimo Cairo, Brendan Mumey +2

A minimum path cover (MPC) of a directed acyclic graph (DAG) $G = (V, E)$ is a minimum-size set of paths that together cover all the vertices of the DAG. Computing an MPC is a basic…

cs.DS2020★ 1 cited

Computing all $s$ - $t$ bridges and articulation points simplified

Massimo Cairo, Shahbaz Khan, Romeo Rizzi +3

Given a directed graph $G$ and a pair of nodes $s$ and $t$ , an $s$ - $t$ bridge of $G$ is an edge whose removal breaks all $s$ - $t$ paths of $G$ . Similarly, an $s$ - $t$ articulation po…

Minimum Path Cover in Parameterized Linear Time

Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time

Computing all s-t bridges and articulation points simplified

Computing all $s$ - $t$ bridges and articulation points simplified