5 citations · 5 across the 8 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DM2022★ 5 cited
On graphs coverable by k shortest paths
Maël Dumas, Florent Foucaud, Anthony Perez +1
We show that if the edges or vertices of an undirected graph can be covered by shortest paths, then the pathwidth of is upper-bounded by a single-exponential function o…
cs.DS2022
Polynomial kernels for edge modification problems towards block and strictly chordal graphs
Maël Dumas, Anthony Perez, Mathis Rocton +1
We consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph and an integer and seeks to…