Funder
Alexander von Humboldt-Stiftung
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference21 articles.
1. Aggarwal, A., Anderson, R.J., Kao, M.: Parallel depth-first search in general directed graphs. SIAM J. Comput. 19(2), 397–409 (1990). https://doi.org/10.1137/0219025
2. Baswana, S., Chaudhury, S.R., Choudhary, K., Khan, S.: Dynamic DFS in undirected graphs: Breaking the O(m) barrier. SIAM J. Comput. 48(4), 1335–1363 (2019). (A preliminary version appeared in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 730–739, 2016). https://doi.org/10.1137/17M114306X
3. Baswana, S., Choudhary, K.: On dynamic DFS tree in directed graphs. In: MFCS, Proceedings, Part II, pp. 102–114 (2015). https://doi.org/10.1007/978-3-662-48054-0_9
4. Baswana, S., Goel, A., Khan, S.: Incremental DFS algorithms: a theoretical and experimental study. In: Czumaj, A. (ed.) Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018, pp. 53–72. SIAM (2018). https://doi.org/10.1137/1.9781611975031.4
5. Baswana, S., Gupta, S.K., Tulsyan, A.: Fault tolerant and fully dynamic DFS in undirected graphs: simple yet efficient. In: Rossmanith, P., Heggernes, P., Katoen, J.P. (eds.) 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26–30, 2019, Aachen, Germany, LIPIcs, vol. 138, pp. 65:1–65:16. Schloss Dagstuhl—Leibniz Center for Computer Science (2019). https://doi.org/10.4230/LIPIcs.MFCS.2019.65
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献