Author:
Costa Isnard Lopes,Lopes Raul,Marino Andrea,Silva Ana
Publisher
Springer Nature Switzerland
Reference19 articles.
1. Arjomandi, E.: On finding all unilaterally connected components of a digraph. Inf. Process. Lett. 5(1), 8–10 (1976)
2. Lecture Notes in Computer Science;S Bhadra,2003
3. Borassi, M., Crescenzi, P., Habib, M.: Into the square: on the complexity of some quadratic-time solvable problems. In: ICTCS. Electronic Notes in Theoretical Computer Science, vol. 322, pp. 51–67. Elsevier (2015)
4. Borodin, A.B., Munro, I.: Notes on efficient and optimal algorithms. Technical report, U. of Toronto and U. of Waterloo, Canada (1972)
5. Casteigts, A.: Finding structure in dynamic networks. arXiv preprint arXiv:1807.07801 (2018)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献