Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Izumi, Taisuke, Kitamura, Naoki, Yamaguchi, Yutaro
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
par: Izumi, Taisuke, et autres
Publié: (2023)

A Cut-Matching Game for Constant-Hop Expanders
par: Haeupler, Bernhard, et autres
Publié: (2022)

Weighted Matching in a Poly-Streaming Model
par: Ullah, Ahammed, et autres
Publié: (2025)

Invitation to Local Algorithms
par: Rozhoň, Václav
Publié: (2024)

Fast algorithms for Vizing's theorem on bounded degree graphs
par: Bernshteyn, Anton, et autres
Publié: (2023)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
par: Assadi, Sepehr
Publié: (2023)

Fast Deterministic Distributed Degree Splitting
par: Maus, Yannic, et autres
Publié: (2026)

Moser-Tardos Algorithm with small number of random bits
par: Csóka, Endre, et autres
Publié: (2022)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
par: Khoury, Seri, et autres
Publié: (2025)

On Distributed Computation of the Minimum Triangle Edge Transversal
par: Censor-Hillel, Keren, et autres
Publié: (2024)

Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems
par: Garg, Vijay K., et autres
Publié: (2026)

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
par: Chang, Yi-Jun
Publié: (2023)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
par: Gil, Yuval, et autres
Publié: (2025)

Parallel Dynamic Maximal Matching
par: Ghaffari, Mohsen, et autres
Publié: (2024)

Perfect Matching with Few Link Activations
par: Mirault, Hugo, et autres
Publié: (2025)

Dynamic Maximal Matching in Clique Networks
par: Li, Minming, et autres
Publié: (2024)

On the Randomized Locality of Matching Problems in Regular Graphs
par: Khoury, Seri, et autres
Publié: (2025)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
par: Cambus, Mélanie, et autres
Publié: (2022)

Reductions in local certification
par: Esperet, Louis, et autres
Publié: (2025)

Scheduled Jacobian Chaining
par: Märtens, Simon, et autres
Publié: (2025)

Lock-Free Augmented Trees
par: Fatourou, Panagiota, et autres
Publié: (2024)

When MIS and Maximal Matching are Easy in the Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

Fast Broadcast in Highly Connected Networks
par: Chandra, Shashwat, et autres
Publié: (2024)

Fast Concurrent Primitives Despite Contention
par: Bender, Michael A., et autres
Publié: (2026)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
par: Blelloch, Guy E., et autres
Publié: (2025)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
par: Dhulipala, Laxman, et autres
Publié: (2024)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
par: Wang, Letong, et autres
Publié: (2023)

Fast Spanning Tree Sampling in Broadcast Congested Clique
par: Anari, Nima, et autres
Publié: (2026)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
par: Ghaffari, Mohsen, et autres
Publié: (2025)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
par: Mordacchini, Matteo, et autres
Publié: (2025)

Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
par: Polyanskii, Nikita, et autres
Publié: (2024)

Skip Hash: A Fast Ordered Map Via Software Transactional Memory
par: Rodriguez, Matthew, et autres
Publié: (2024)

Distributed Stochastic Graph Algorithms
par: Censor-Hillel, Keren, et autres
Publié: (2026)

Optimal Distributed Replacement Paths
par: Chang, Yi-Jun, et autres
Publié: (2025)

Bounded Memory in Distributed Networks
par: Basat, Ran Ben, et autres
Publié: (2025)

Distributed Graph Algorithms with Predictions
par: Boyar, Joan, et autres
Publié: (2025)

History Trees and Their Applications
par: Viglietta, Giovanni
Publié: (2024)

Computing in a Faulty Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

Distributed Maximum Flow in Planar Graphs
par: Abd-Elhaleem, Yaseen, et autres
Publié: (2024)

Meta-Theorems for Cuttable Distributed Problems
par: Bonamy, Marthe, et autres
Publié: (2026)