activity
20082021
most citedA distributed algorithm for computing and updating the process number of a forest

3 citations · 4 across the 5 of their papers we have counts for

collaborators
Showing 2021Show 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.DS2021

Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation

David Coudert, André Nusser, Laurent Viennot

Hyperbolicity is a graph parameter which indicates how much the shortest-path distance metric of a graph deviates from a tree metric. It is used in various fields such as networkin…