30 citations · 52 across the 10 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DC2015★ 4 cited
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation
Leonid Barenboim, Michael Elkin, Cyril Gavoille
A partition of into clusters of strong (respectively, weak) diameter , such that the supergraph obtained by contracting each is -colo…
cs.DS2015
Simpler, faster and shorter labels for distances in graphs
Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen +1
We consider how to assign labels to any undirected graph with n nodes such that, given the labels of two nodes and no other information regarding the graph, it is possible to deter…