2 citations · 3 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
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 -vertex graph setting, we have to handle updates (insertions and removals…
cs.DS2017
Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete
Kitti Gelle, Szabolcs Ivan
Disjoint-Set forests, consisting of Union-Find trees, are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact…