Maintaning maximal matching with lookahead

Kitti Gelle, Szabolcs Ivan

In this paper we study the problem of fully dynamic maximal matching with lookahead. In a fully dynamic $n$-vertex graph setting, we have to handle updates (insertions and removals…