According to this paper, closeness and geometric centralities can be efficiently approximated in the semi-streaming model. We should examine whether these algorithms (or variations) can be applied to unbounded streams and if yes, implement them and compare.
According to this paper, closeness and geometric centralities can be efficiently approximated in the semi-streaming model. We should examine whether these algorithms (or variations) can be applied to unbounded streams and if yes, implement them and compare.