52 citations · 150 across the 20 of their papers we have counts for
4 papers · 1 filter
Multi-View Structural Graph Summaries
Jonatan Frank, Andor Diera, David Richerby +1
A structural graph summary is a small graph representation that preserves structural information necessary for a given task. The summary is used instead of the original graph to co…
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…
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…
Faster Exponential-time Algorithms for Approximately Counting Independent Sets
Leslie Ann Goldberg, John Lapinskas, David Richerby
Counting the independent sets of a graph is a classical #P-complete problem, even in the bipartite case. We give an exponential-time approximation scheme for this problem which is…