Decremental matching in general weighted graphs
From MaRDI portal
Cites work
- (1 + )-approximate incremental matching in constant deterministic amortized time
- A data structure for dynamic trees
- A framework for dynamic matching in weighted graphs
- Concentration of Measure for the Analysis of Randomized Algorithms
- Decremental matching in general graphs
- Deterministic decremental reachability, SCC, and shortest paths via directed expanders and congestion balancing
- Dynamic algorithms for maximum matching size
- Dynamic matching with better-than-2 approximation in polylogarithmic update time
- Fully dynamic (1+ e)-approximate matchings
- Higher lower bounds from the 3SUM conjecture
- scientific article; zbMATH DE number 6866348 (Why is no real title available?)
- Incremental \((1-\varepsilon)\)-approximate dynamic matching in \(O(\text{poly}((1/\varepsilon))\) update time
- Linear programming in the semi-streaming model with application to the maximum matching problem
- Linear-time approximation for maximum weight matching
- Maintaining approximate maximum matching in an incremental bipartite graph in polylogarithmic update time
- New trade-offs for fully dynamic matching via hierarchical EDCS
- On regularity lemma and barriers in streaming and dynamic matching
- Regularized box-simplex games and dynamic decremental bipartite matching
- Rounding dynamic matchings against an adaptive adversary
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
This page was built for publication: Decremental matching in general weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875141)
