71 citations · 112 across the 28 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2018★ 4 cited
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
Feodor F. Dragan, Guillaume Ducoffe, Michel Habib +1
In the context of fine-grained complexity, we investigate the notion of certificate enabling faster polynomial-time algorithms. We specifically target radius (minimum eccentricity)…
cs.DM2012
Can Selfish Groups be Self-Enforcing?
Guillaume Ducoffe, Dorian Mazauric, Augustin Chaintreau
Algorithmic graph theory has thoroughly analyzed how, given a network describing constraints between various nodes, groups can be formed among these so that the resulting configura…