14 citations · 50 across the 20 of their papers we have counts for
1 paper · 1 filter
Amos Korman, Shay Kutten
We study the question of ``how robust are the known lower bounds of labeling schemes when one increases the number of consulted labels''. Let f be a function on pairs of vertices…