97 citations · 229 across the 33 of their papers we have counts for
3 papers · 2 filters
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…
Improved Oracles for Time-Dependent Road Networks
Spyros Kontogiannis, Georgia Papastavrou, Andreas Paraskevopoulos +2
A novel landmark-based oracle (CFLAT) is presented, which provides earliest-arrival-time route plans in time-dependent road networks. To our knowledge, this is the first oracle tha…
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…