3 papers
cs.DC2026
ptimal Distributed Maximum Flow Approximation in Undirected Planar Graphs
Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann
Persistent efforts in recent years have been devoted to devising distributed algorithms for fundamental optimization problems in planar graphs. In particular, for Single-Source Sho…
cs.DC2026
A Simple Distributed Deterministic Planar Separator
Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann
A balanced separator of a graph is a set of vertices whose removal disconnects the graph into connected components that are a constant factor smaller than . Lipton and Tarja…
cs.DC2025
Distributed Maximum Flow in Planar Graphs
Yaseen Abd-Elhaleem, Michal Dory, Merav Parter +1
The dual of a planar graph is a planar graph that has a vertex for each face of and an edge for each pair of adjacent faces of . The profound relationship between…