12 citations · 37 across the 15 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud +1
In this paper, we study a dynamic analogue of the Path Cover problem, which can be solved in polynomial-time in directed acyclic graphs. A temporal digraph has an arc set that chan…
cs.DS2024
The Canadian Traveller Problem on outerplanar graphs
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev +5
We study the -Canadian Traveller Problem, where a weighted graph with a source and a target are given. This problem also has a hidden input $E_* \s…