Sensitivity analysis of the maximum matching problem

DOI10.4230/LIPICS.ITCS.2021.58MaRDI QIDQ7229347zbMATH OpenFDO

Authors Yuichi Yoshida, Samson Zhou

Publication date 15 April 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2021.58

zbMATH Keywords

graph algorithmsmaximum matchingsensitivity analysis

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• Deterministic coin tossing with applications to optimal parallel list ranking
• scientific article; zbMATH DE number 7788381 (Why is no real title available?)
• Improved streaming algorithms for weighted matching, via unweighted matching
• Optimal dynamic distributed MIS
• Structural results on matching estimation with applications to streaming

Cited in

(1)

• Courcelle's theorem for Lipschitz continuity

This page was built for publication: Sensitivity analysis of the maximum matching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229347)