What is the best deterministic result for maintaining the dynamic transitive closure in a directed graph with only edge insertion?
I read some papers on the dynamic transitive closure problem with both edge insertion and deletion. However, is there any better algorithms for that with only edge insertion?