Currently browsing

Strong Connectivity and Shortest Paths for Checking Models

Vincent Bloemen first promotor: prof. dr. Jaco van de Pol (UT) second promotor: prof. dr. Wil van der Aalst (RWTH Aachen) University of Twente Date: 10 July 2019 Thesis: PDF Summary We study directed graphs and focus on algorithms for two classical graph problems; the decomposition of a graph into Strongly …