A near-linear-time algorithm finds a well-spread perfect matching in bridgeless cubic graphs by using a cactus representation of 2-edge-cuts with efficient updates under reductions.
On the Time Complexity of Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
A near-linear-time algorithm finds a well-spread perfect matching in bridgeless cubic graphs by using a cactus representation of 2-edge-cuts with efficient updates under reductions.