2 papers
math.CO2026
Finding Minimum Matching Cuts in -free Graphs
Felicia Lucke, Joseph Marchand, Jannik Olbrich
A matching cut is a matching that is also an edge cut. In the problem Minimum Matching Cut, we ask for a matching cut with the minimum number of edges in the matching. We investiga…
quant-ph2025
Exponential Quantum Advantage for Message Complexity in Distributed Algorithms
François Le Gall, Maël Luce, Joseph Marchand +1
We investigate how much quantum distributed algorithms can outperform classical distributed algorithms with respect to the message complexity (the overall amount of communication u…