23 citations · 150 across the 51 of their papers we have counts for
Showing 2019 · cs.DSShow all
2 papers · 2 filters
cs.DS2019
Shorter Labeling Schemes for Planar Graphs
Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every graph from the class, assigns bit strings (labels) to vertices of so that for…
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…