3 citations · 4 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2021
Hyperbolicity Computation through Dominating Sets
David Coudert, André Nusser, Laurent Viennot
Hyperbolicity is a graph parameter related to how much a graph resembles a tree with respect to distances. Its computation is challenging as the main approaches consist in scanning…
cs.DM2008★ 3 cited
A distributed algorithm for computing and updating the process number of a forest
David Coudert, Florian Huc, Dorian Mazauric
In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pa…