Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation

Documenti analoghi

• A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
  di: Izumi, Taisuke, et al.
  Pubblicazione: (2023)
• A Cut-Matching Game for Constant-Hop Expanders
  di: Haeupler, Bernhard, et al.
  Pubblicazione: (2022)
• Weighted Matching in a Poly-Streaming Model
  di: Ullah, Ahammed, et al.
  Pubblicazione: (2025)
• Invitation to Local Algorithms
  di: Rozhoň, Václav
  Pubblicazione: (2024)
• Fast algorithms for Vizing's theorem on bounded degree graphs
  di: Bernshteyn, Anton, et al.
  Pubblicazione: (2023)