31 citations · 155 across the 25 of their papers we have counts for
Showing 2017 · cs.DCShow all
2 papers · 2 filters
cs.DC2017
Communication-free Massively Distributed Graph Generation
Daniel Funke, Sebastian Lamm, Ulrich Meyer +5
Analyzing massive complex networks yields promising insights about our everyday lives. Building scalable algorithms to do so is a challenging task that requires a careful analysis…
cs.DC2017
Shared Memory Parallel Subgraph Enumeration
Raphael Kimmig, Henning Meyerhenke, Darren Strash
The subgraph enumeration problem asks us to find all subgraphs of a target graph that are isomorphic to a given pattern graph. Determining whether even one such isomorphic subgraph…