1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
Babak Ghanbari, Robert Šámal
We present a near-linear-time algorithm that, given a bridgeless cubic graph, finds a perfect matching intersecting every 3-edge-cut in exactly one edge. This improves over a cubic…
cs.DS2025
On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
Babak Ghanbari, Robert Šámal
We present an algorithm for finding a perfect matching in a -edge-connected cubic graph that intersects every -edge cut in exactly one edge. Specifically, we propose an algor…