3 citations · 4 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
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…
cs.DS2017★ 1 cited
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…