Skip to content

Author

Yann Bourreau

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Dynamic 3-Coloring of Bipartite Graphs with Optimal Locality

We give a dynamic graph algorithm which maintains a 3-coloring in bipartite graphs under edge insertions such that the coloring only changes within a radius of $O(\log n)$ around an inserted edge. In the context of locality theory in distributed graph algorithms, this gives an upper bound on the locality under the dyna...

Yann Bourreau, Filippo Casagrande, T. Göttlicher et al. · 0 citations
Preprint Oct 2026

Fast Distributed $(\Delta + 1)$-Edge Coloring in Bipartite Graphs

We show that, on bipartite $n$-vertex graphs in the LOCAL model of distributed computation, $(\Delta + 1)$-edge coloring can be solved deterministically in $O(f(\Delta) \log n)$ rounds for some function $f$. In particular this implies a deterministic $O(\log n)$-round upper bound for $(\Delta + 1)$-edge coloring on bip...

Yann Bourreau, Sebastian Brandt, Ananth Narayanan · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.