1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2022★ 1 cited
Computing -Bisimulations for Large Graphs: A Comparison and Efficiency Analysis
Jannik Rau, David Richerby, Ansgar Scherp
Summarizing graphs w.r.t. structural features is important to reduce the graph's size and make tasks like indexing, querying, and visualization feasible. Our generic parallel BRS a…
cs.DS2021
Time and Memory Efficient Parallel Algorithm for Structural Graph Summaries and two Extensions to Incremental Summarization and -Bisimulation for Long -Chaining
Till Blume, Jannik Rau, David Richerby +1
We developed a flexible parallel algorithm for graph summarization based on vertex-centric programming and parameterized message passing. The base algorithm supports infinitely man…