Marc Heinrich

activity

20142022

most citedAsymptotically exact streaming algorithms

4 citations · 7 across the 14 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

cs.DS2019★ 1 cited

The Perfect Matching Reconfiguration Problem

Marthe Bonamy, Nicolas Bousquet, Marc Heinrich +5

We study the perfect matching reconfiguration problem: Given two perfect matchings of a graph, is there a sequence of flip operations that transforms one into the other? Here, a fl…

cs.DM2019

A polynomial version of Cereceda's conjecture

Nicolas Bousquet, Marc Heinrich

Let $k$ and $d$ be such that $k \geq d + 2$ . Consider two $k$ -colourings of a $d$ -degenerate graph $G$ . Can we transform one into the other by recolouring one vertex at each step whil…