Gabow's $O(\sqrt{n}m)$ Maximum Cardinality Matching Algorithm, Revisited

Documenti analoghi

• Gabow's Cardinality Matching Algorithm in General Graphs: Implementation and Experiments
  di: Ansaripour, Matin, et al.
  Pubblicazione: (2024)
• A Refutation of Elmasry's $\tilde{O}(m \sqrt{n})$-Time Algorithm for Single-Source Shortest Paths
  di: Atalig, Sunny, et al.
  Pubblicazione: (2025)
• Maximum Bipartite Matching in $n^{2+o(1)}$ Time via a Combinatorial Algorithm
  di: Chuzhoy, Julia, et al.
  Pubblicazione: (2024)
• A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
  di: Izumi, Taisuke, et al.
  Pubblicazione: (2023)
• Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching
  di: Zheng, Da Wei, et al.
  Pubblicazione: (2023)