Dynamic Matching Algorithms in Practice
From MaRDI portal
Publication:5874529
DOI10.4230/LIPIcs.ESA.2020.58OpenAlexW3082437107MaRDI QIDQ5874529
No author found.
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2004.09099
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple approximation algorithm for the weighted matching problem
- Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time
- Maintaining a large matching and a small vertex cover
- TWO THEOREMS IN GRAPH THEORY
- An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
- Faster Fully Dynamic Matchings with Small Approximation Ratios
- Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time
- Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
- Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach
- (1 + ∊)-Approximate Incremental Matching in Constant Deterministic Amortized Time
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time
- Paths, Trees, and Flowers
- New deterministic approximation algorithms for fully dynamic matching
- Engineering Algorithms for Approximate Weighted Matching
- Benchmarking optimization software with performance profiles.
This page was built for publication: Dynamic Matching Algorithms in Practice
