Maintaining a large matching and a small vertex cover
Proceedings of the forty-second ACM symposium on Theory of computing
Dynamic approximate vertex cover and maximum matching
Property testing
Dynamic approximate vertex cover and maximum matching
Property testing
Simple deterministic algorithms for fully dynamic maximal matching
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |