3 citations · 3 across the 1 of their papers we have counts for
1 paper
Yoichi Iwata, Keigo Oka
Fully dynamic graph is a data structure that (1) supports edge insertions and deletions and (2) answers problem specific queries. The time complexity of (1) and (2) are referred to…