19 citations · 35 across the 6 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DS2017★ 7 cited
Distributed Graph Clustering using Modularity and Map Equation
Michael Hamann, Ben Strasser, Dorothea Wagner +1
We study large-scale, distributed graph clustering. Given an undirected graph, our objective is to partition the nodes into disjoint sets called clusters. A cluster should contain…
cs.DS2017
Computing Tree Decompositions with FlowCutter: PACE 2017 Submission
Ben Strasser
We describe the algorithm behind our PACE 2017 submission to the heuristic tree decomposition computation track. It was the only competitor to solve all instances and won a tight s…
cs.DS2017★ 1 cited
Connection Scan Algorithm
Julian Dibbelt, Thomas Pajor, Ben Strasser +1
We introduce the Connection Scan Algorithm (CSA) to efficiently answer queries to timetable information systems. The input consists, in the simplest setting, of a source position a…