← 研踪 PaperTrailarXiv:2610.40591 · v1
Maximum Cardinality Matching in $n^{2+o(1)}$ Time
首次提交 2026-10-30 01:48
版本更新 2026-10-30 01:48
雷达观测 2026-10-30 13:28
摘要
We consider the maximum cardinality matching problem in general graphs, and give an $n^{2+o(1)}$-time algorithm for the problem. Our work builds on recent work on combinatorial algorithms for maximum flow and extends the techniques to skew-symmetric flow problems which capture general matchings as a special case.
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-10-30 01:48 · 最新观测版本
Maximum Cardinality Matching in $n^{2+o(1)}$ Time
We consider the maximum cardinality matching problem in general graphs, and give an $n^{2+o(1)}$-time algorithm for the problem. Our work builds on recent work on combinatorial algorithms for maximum flow and extends the techniques to skew-symmetric flow problems which capture general matchings as a special case.
查看此版本解读 →查看此版本原文 ↗