Publisher
Springer International Publishing
Reference25 articles.
1. Abboud, A., Williams, V.V.: Popular conjectures imply strong lower bounds for dynamic problems. In: IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 434–443. IEEE (2014)
2. Baswana, S., Chaudhury, S.R., Choudhary, K., Khan, S.: Dynamic DFS in undirected graphs: breaking the $$O(m)$$ barrier. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 730–739. SIAM (2016)
3. Chan, T.M.: Dynamic subgraph connectivity with geometric applications. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 7–13. ACM (2002)
4. Chan, T.M., Pǎtraşcu, M., Roditty, L.: Dynamic connectivity: Connecting to networks and geometry. SIAM Journal on Computing 40(2), 333–349 (2011)
5. Chen, L., Duan, R., Wang, R., Zhang, H.: Improved algorithms for maintaining DFS tree in undirected graphs. CoRR, abs/1607.04913 (2016)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献