Blossom VI delivers near-linear runtime for minimum weight perfect matching by shrinking cherry blossoms into supernodes instead of traditional blossoms.
Finding a maximum cut of a planar graph in polynomial time.SIAM Journal on Computing, 4(3):221–225
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Blossom VI: A Practical Minimum Weight Perfect Matching Algorithm
Blossom VI delivers near-linear runtime for minimum weight perfect matching by shrinking cherry blossoms into supernodes instead of traditional blossoms.