D. Peleg

activity

20082026

most citedSparse Fault-Tolerant BFS Trees

19 citations · 35 across the 14 of their papers we have counts for

collaborators

Showing 2019 · cs.DSShow all

2 papers · 2 filters

cs.DS2019

Efficiently Realizing Interval Sequences

Amotz Bar-Noy, Keerti Choudhary, David Peleg +1

We consider the problem of realizable interval-sequences. An interval sequence comprises of $n$ integer intervals $[a_{i}, b_{i}]$ such that $0 \leq a_{i} \leq b_{i} \leq n - 1$ , and is said t…

cs.DS2019

Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods

Amotz Bar-Noy, Keerti Choudhary, David Peleg +1

The classical problem of degree sequence realizability asks whether or not a given sequence of $n$ positive integers is equal to the degree sequence of some $n$ -vertex undirected s…