14 citations · 25 across the 8 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
Lars Gottesbüren, Michael Hamann, Dorothea Wagner
In this paper, we propose HyperFlowCutter, an algorithm for balanced hypergraph bipartitioning. It is based on minimum S-T hyperedge cuts and maximum flows. It computes a sequence…
cs.DS2019★ 14 cited
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies
Lars Gottesbüren, Michael Hamann, Tim Niklas Uhl +1
Graph partitioning has many applications. We consider the acceleration of shortest path queries in road networks using Customizable Contraction Hierarchies (CCH). It is based on co…