62 citations · 316 across the 38 of their papers we have counts for
Showing 2019 · cs.DSShow all
2 papers · 2 filters
cs.DS2019
Min-Cost Flow in Unit-Capacity Planar Graphs
Adam Karczmarz, Piotr Sankowski
In this paper we give an time algorithm for computing min-cost flow (or min-cost circulation) in unit capacity planar multigraphs where edge costs…
cs.DS2019
Walking Randomly, Massively, and Efficiently
Jakub Łącki, Slobodan Mitrović, Krzysztof Onak +1
We introduce a set of techniques that allow for efficiently generating many independent random walks in the Massive Parallel Computation (MPC) model with space per machine strongly…