19 citations · 110 across the 50 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DS2024
Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults
Merav Parter, Elad Tzalik
An -edge (or vertex) connectivity certificate is a sparse subgraph that maintains connectivity under the failure of at most edges (or vertices). It is well known that any $n…
cs.DC2024
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…
cs.DS2024
Parks and Recreation: Color Fault-Tolerant Spanners Made Local
Merav Parter, Asaf Petruschka, Shay Sapir +1
We provide new algorithms for constructing spanners of arbitrarily edge- or vertex-colored graphs, that can endure up to failures of entire color classes. The failure of even a…