Showing cs.DSShow all
3 papers · 1 filter
cs.DS2013★ 19 cited
Sparse Fault-Tolerant BFS Trees
Merav Parter, David Peleg
This paper addresses the problem of designing a sparse {\em fault-tolerant} BFS tree, or {\em FT-BFS tree} for short, namely, a sparse subgraph of the given network such th…
cs.DS2012★ 1 cited
Secluded Connectivity Problems
Shiri Chechik, M. P. Johnson, Merav Parter +1
Consider a setting where possibly sensitive information sent over a path in a network is visible to every {neighbor} of the path, i.e., every neighbor of some node on the path, thu…
cs.DS2011
The Topology of Wireless Communication
Erez Kantor, Zvi Lotker, Merav Parter +1
In this paper we study the topological properties of wireless communication maps and their usability in algorithmic design. We consider the SINR model, which compares the received…