Publisher
Springer International Publishing
Reference10 articles.
1. Bloem, R., Gabow, H.N., Somenzi, F.: An algorithm for strongly connected component analysis in n log n symbolic steps. Form. Methods Syst. Des. 28, 37–56 (2006)
2. Lecture Notes in Computer Science;LK Fleischer,2000
3. Harary, F., Norman, R.Z., Cartwright, D.: Structural Models: an Introduction to the Theory of Directed Graphs. Wiley, New York (1965)
4. Łacki, J.:Improved deterministic algorithms for decremental reachability and strongly connected components. ACM Trans. Algorithms 9(3), Article 27 (2013)
5. Treur, J.: Verification of temporal-causal network models by mathematical analysis. Vietnam J. Comput. Sci. 3, 207-221 (2016)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献