Publisher
Springer Nature Switzerland
Reference29 articles.
1. Lecture Notes in Computer Science;W Beek,2014
2. Bizer, C., Schultz, A.: The Berlin SPARQL benchmark. Int. J. Semant. Web Inf. Syst. 5(2), 1–24 (2009). https://doi.org/10.4018/jswis.2009040101
3. Blom, S., Orzan, S.: A distributed algorithm for strong bisimulation reduction of state spaces. Electron. Notes Theor. Comput. Sci. 68(4), 523–538 (2002). https://doi.org/10.1016/S1571-0661(05)80390-1
4. Blume, T., Rau, J., Richerby, D., Scherp, A.: Time and memory efficient parallel algorithm for structural graph summaries and two extensions to incremental summarization and $$k$$-bisimulation for long $$k$$-chaining. CoRR abs/2111.12493 (2021). arxiv:2111.12493
5. Blume, T., Richerby, D., Scherp, A.: Incremental and parallel computation of structural graph summaries for evolving graphs. In: CIKM, pp. 75–84. ACM (2020). https://doi.org/10.1145/3340531.3411878