Joint ICE-TCS@Reykjavik University/GSSI seminar: Pierluigi Crescenzi
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs
I am pleased to inform you that Pierluigi Crescenzi (IRIF, Paris Diderot, France) will deliver a joint ICE-TCS@Reykjavik University/GSSI virtual seminar on Monday, 18 May, at 13:30 GMT/15:30 Italian time.
The title and abstract of the talk, which will survey recent work by Pilu and coauthors on the enumeration of separators in directed acyclic graphs, are below. I will send a link to join the seminar in due course.
---------------
TITLE. Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs
SPEAKER: Pierluigi Crescenzi (IRIF, Paris Diderot, France) WWW: https://www.irif.fr/users/piluc/index
ABSTRACT. Temporal graphs are graphs in which arcs have temporal labels, specifying at which time they can be traversed. Motivated by recent results concerning the reliability analysis of a temporal graph through the enumeration of minimal cutsets in the corresponding line graph, in this paper we attack the problem of enumerating minimal s-d separators in s-d directed acyclic graphs (in short, s-d DAGs), also known as 2-terminal DAGs or s-t digraphs. Our main result is an algorithm for enumerating all the minimal s-d separators in a DAG with O(m) cost per separator, where m is the number of arcs. To this aim, we give a characterization of the minimal s-d separators in a DAG through vertex cuts of an expanded version of the DAG itself. As a consequence of our main result, we provide an algorithm for enumerating all the minimal s-d cutsets in a temporal graph with cost O(m^2) per cutset, where m is the number of temporal arcs. This is a joint work with Alessio Conte, Andrea Marino, and Giulia Punzi.
