A minimum chain cover (MCC) of a $ k $-width directed acyclic graph (DAG) $ G=(V, E) $ is
a set of $ k $ chains (paths in the transitive closure) of $ G $ such that every vertex appears …

Computing a minimum path cover (MPC) of a directed acyclic graph (DAG) is a fundamental
problem with a myriad of applications, including reachability. Although it is known how to …

Computing a minimum path cover (MPC) of a directed acyclic graph (DAG) is a fundamental
problem with a myriad of applications, including reachability. Although it is known how to …

We consider the fundamental problems of reachability shortcuts and compression schemes
of the transitive closure (TC) of n-vertex directed acyclic graphs (DAGs) G when we are …

For a given (possibly directed) graph G, a hopset (aka shortcut set) is a (small) set of edges
whose addition reduces the graph diameter while preserving desired properties from the …

For a given n-vertex DAG G=(V, E) with transitive-closure TC (G), a chain is a directed path
in TC (G) and an antichain is an independent set in TC (G). The maximum k-antichain …

Given their versatility, nowadays graphs are a popular choice in Bioinformatics to model
data, as in the case of pan-genomics, and to model problems, as in the case of multi …

A minimum chain cover (MCC) of a k-width directed acyclic graph (DAG) G=(V, E) is a set of
k chains (paths in the transitive closure) of G such that every vertex appears in at least one …