1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
On the maximum weight convex problem for some geometric graph-convexities
Fariza Aklouche, Pierre Bergé, Michel Habib
For a given geometric graph-convexity on a graph equipped with a weight function on the vertices with value in , the Max Weight Convex Set problem consists in deter…
cs.DS2021★ 1 cited
Diameter, radius and all eccentricities in linear time for constant-dimension median graphs
Pierre Bergé, Michel Habib
Median graphs form the class of graphs which is the most studied in metric graph theory. Recently, Bénéteau et al. [2019] designed a linear-time algorithm computing both the -cl…