2 papers
cs.CC2025
Recognizing and Realizing Temporal Reachability Graphs
Thomas Erlebach, Othon Michail, Nils Morawietz
A temporal graph can be represented by an underlying graph together with a function that assigns to each edge the set of time steps durin…
cs.DS2024
A faster algorithm for the construction of optimal factoring automata
Thomas Erlebach, Kleitos Papadopoulos
The problem of constructing optimal factoring automata arises in the context of unification factoring for the efficient execution of logic programs. Given an ordered set of str…