3 citations · 4 across the 5 of their papers we have counts for
6 papers
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…
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…
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
David Coudert, Guillaume Ducoffe, Alexandru Popa
Parameterized complexity theory has enabled a refined classification of the difficulty of NP-hard optimization problems on graphs with respect to key structural properties, and so…
Feasibility study on distributed simulations of BGP
David Coudert, Luc Hogie, Aurélien Lancin +3
The Autonomous System (AS)-level topology of the Internet that currently comprises 40k ASs, is growing at a rate of about 10% per year. In these conditions, Border Gateway Protocol…
Feasibility study on distributed simulations of BGP
David Coudert, Luc Hogie, Aurélien Lancin +3
The Autonomous System (AS) topology of the Internet (up to 61k ASs) is growing at a rate of about 10% per year. The Border Gateway Protocol (BGP) starts to show its limits in terms…
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…