Peleg David

David Peleg

Information about the author David Peleg will soon be added to the site.
Found 8 papers in total
Secluded Connectivity Problems
Secluded Connectivity Problems
2017
Consider a setting where possibly sensitive information sent over a path in a network...
A note on exact distance labeling
A note on exact distance labeling
2011
• Exact distance‐labels of edge‐weighted undirected graphs. •...
f‐Sensitivity Distance Oracles and Routing Schemes
f‐Sensitivity Distance Oracles and Routing Schemes
2012
An f‐sensitivity distance oracle for a weighted undirected graph G ( V , E ) is...
Labeling schemes for tree representation
Labeling schemes for tree representation
2009
This paper deals with compact label-based representations for trees. Consider an n...
The compactness of interval routing
The compactness of interval routing
1999
The compactness of a graph measures the space complexity of its shortest path routing...
Approximating the weight of shallow Steiner trees
Approximating the weight of shallow Steiner trees
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with...
A sublinear time distributed algorithm for minimum-weight spanning trees
A sublinear time distributed algorithm for minimum-weight spanning trees
1998
This paper considers the question of identifying the parameters governing the behavior...
Traffic-light scheduling on the grid
Traffic-light scheduling on the grid
1994
This paper studies the problem of route scheduling under the telephone model of...
Papers per page: