1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
Fast Distributed -Edge Coloring in Bipartite Graphs
Yann Bourreau, Sebastian Brandt, Ananth Narayanan
We show that, on bipartite -vertex graphs in the LOCAL model of distributed computation, -edge coloring can be solved deterministically in rounds for so…
A Fast Deterministic Algorithm for -edge coloring in CONGEST
Sebastian Brandt, Ananth Narayanan, Alexandre Nolin
Vizing's theorem states that any graph of maximum degree can be properly edge-colored with colors (which is optimal in general). A recent breakthrough result by Bernshte…
Towards Optimal Deterministic LOCAL Algorithms on Trees
Sebastian Brandt, Ananth Narayanan
While obtaining optimal algorithms for the most important problems in the LOCAL model has been one of the central goals in the area of distributed algorithms since its infancy, tig…
Optimal Deterministic Rendezvous in Labeled Lines
Yann Bourreau, Ananth Narayanan, Alexandre Nolin
In a rendezvous task, some mobile agents dispersed in a network have to gather at an arbitrary common site. We consider the rendezvous problem on the infinite labeled line, with $2…