Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Improved exploration of temporal graphs
Paul Bastide, Carla Groenland, Lukas Michel +1
A temporal graph is a sequence of graphs on the same vertex set of size . The \emph{temporal exploration problem} asks for the length of the shortest seque…
cs.DS2024
Quasi-linear distance query reconstruction for graphs of bounded treelength
Paul Bastide, Carla Groenland
In distance query reconstruction, we wish to reconstruct the edge set of a hidden graph by asking as few distance queries as possible to an oracle. Given two vertices and ,…