Pierre Bergé | DeepAI

AI Chat

Featured Co-authors

Édouard Bonnet
45 publications
Guillaume Ducoffe
22 publications
Carl Feghali
17 publications
Michel Habib
11 publications
Rémi Watrigant
10 publications
Hugues Déprés
4 publications
Arpad Rimmel
4 publications
Anthony Busson
1 publication
Benjamin Mouscadet
1 publication
Joanna Tomasik
1 publication

∙ 07/15/2022

Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width

For any ε > 0, we give a polynomial-time n^ε-approximation algorithm for...

0 Pierre Bergé, et al. ∙

∙ 04/12/2022

1-Extendability of independent sets

In the 70s, Berge introduced 1-extendable graphs (also called B-graphs),...

0 Pierre Bergé, et al. ∙

∙ 12/16/2021

Deciding twin-width at most 4 is NP-complete

We show that determining if an n-vertex graph has twin-width at most 4 i...

0 Pierre Bergé, et al. ∙

∙ 10/06/2021

Subquadratic-time algorithm for the diameter and all eccentricities on median graphs

On sparse graphs, Roditty and Williams [2013] proved that no O(n^2-ε)-ti...

0 Pierre Bergé, et al. ∙

∙ 05/25/2021

Diameter, radius and all eccentricities in linear time for constant-dimension median graphs

Median graphs form the class of graphs which is the most studied in metr...

0 Pierre Bergé, et al. ∙

∙ 07/04/2019

Fixed-parameter tractability of counting small minimum (S,T)-cuts

The parameterized complexity of counting minimum cuts stands as a natura...

0 Pierre Bergé, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world