Finding Minimal Clusters in st-DAGs

Ulrich Vogl, Markus Siegle

Directed Acylic Graphs with a single entry vertex and a single exit vertex (st-DAGs) have many applications. For instance, they are frequently used for modelling flow problems or p…