Author:
Hou Junteng,Wang Shupeng,Wu Guangjun,Ma Bingnan,Zhang Lei
Publisher
Springer International Publishing
Reference22 articles.
1. Zhang, Z., Yu, J.X., Qin, L., Chang, L., Lin, X.: I/O efficient: computing SCCs in massive graphs. VLDB J.—Int. J. Very Large Data Bases 24(2), 245–270 (2015)
2. Xie, A., Beerel, P.A.: Implicit enumeration of strongly connected components and an application to formal verification. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(10), 1225–1230 (2000)
3. Orzan, S.: On distributed verification and verified distribution, Ph.D. dissertation, Center for Mathematics and Computer Science (2004)
4. Fan, W., Li, J., Ma, S., Wang, H., Wu, Y.: Graph homomorphism revisited for graph matching. Proc. VLDB Endow. 3(1–2), 1161–1172 (2010)
5. Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(4), 146–160 (1972)