6 citations · 13 across the 18 of their papers we have counts for
Showing 2024 · cs.DSShow all
2 papers · 2 filters
cs.DS2024
Quasilinear-time eccentricities computation, and more, on median graphs
Pierre Bergé, Guillaume Ducoffe, Michel Habib
Computing the diameter, and more generally, all eccentricities of an undirected graph is an important problem in algorithmic graph theory and the challenge is to identify graph cla…
cs.DS2024
Practical Computation of Graph VC-Dimension
David Coudert, Mónika Csikós, Guillaume Ducoffe +1
For any set system , a subset is called \emph{shattered} if every results from the intersection of with some set in…