3 citations · 3 across the 11 of their papers we have counts for
4 papers · 1 filter
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 ,…
Random embeddings of bounded degree trees with optimal spread
Paul Bastide, Clément Legrand-Duchesne, Alp Müyesser
A seminal result of Komlós, Sárközy, and Szemerédi states that any n-vertex graph G with minimum degree at least (1/2 + α)n contains every n-vertex tree T of bounded degree. Recent…
Distance Reconstruction of Sparse Random Graphs
Paul Bastide
In the distance query model, we are given access to the vertex set of a -vertex graph , and an oracle that takes as input two vertices and returns the distance between these…
Path eccentricity of -AT-free graphs and application on graphs with the consecutive ones property
Paul Bastide, Claire Hilaire, Eileen Robinson
The central path problem is a variation on the single facility location problem. The aim is to find, in a given connected graph , a path minimizing its eccentricity, which i…