7 citations · 9 across the 7 of their papers we have counts for
7 papers
Arc-Flags Meet Trip-Based Public Transit Routing
Ernestine Großmann, Jonas Sauer, Christian Schulz +1
We present Arc-Flag TB, a journey planning algorithm for public transit networks which combines Trip-Based Public Transit Routing (TB) with the Arc-Flags speedup technique. Compare…
FREIGHT: Fast Streaming Hypergraph Partitioning
Kamal Eyubov, Marcelo Fonseca Faraj, Christian Schulz
Partitioning the vertices of a (hyper)graph into k roughly balanced blocks such that few (hyper)edges run between blocks is a key problem for large-scale distributed processing. A…
Improved Exact and Heuristic Algorithms for Maximum Weight Clique
Roman Erhardt, Kathrin Hanauer, Nils Kriege +2
We propose improved exact and heuristic algorithms for solving the maximum weight clique problem, a well-known problem in graph theory with many applications. Our algorithms interl…
Engineering Fully Dynamic -Orientation Algorithms
Jannick Borowitz, Ernestine Großmann, Christian Schulz
A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers certain queries that are specific to the problem under consideratio…
Faster Local Motif Clustering via Maximum Flows
Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz
Local clustering aims to identify a cluster within a given graph that includes a designated seed node or a significant portion of a group of seed nodes. This cluster should be well…
More Recent Advances in (Hyper)Graph Partitioning
Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj +8
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the last decade in practical…