25 citations · 49 across the 22 of their papers we have counts for
1 paper · 1 filter
Ofer Neiman, Shay Solomon
A maximal matching can be maintained in fully dynamic (supporting both addition and deletion of edges) n-vertex graphs using a trivial deterministic algorithm with a worst-case u…