By Topic

Sphere packing and local majorities in graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Linial, N. ; Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel ; Peleg, D. ; Rabinovich, Yu. ; Saks, M.

The paper concerns some extremal problems on packing spheres in graphs and covering graphs by spheres. Tight bounds are provided for these problems on general graphs. The bounds are then applied to answer the following question: Let f be a nonnegative function defined on the vertices of a graph G, and suppose one has a lower bound on the local averages of f, i.e., on f's average over every j-neighborhood in G for j=1,. . .,r . What can be concluded globally? I.e, what can be said about the average of f over all G? This question arose in connection with issues of locality in distributed network computation. The average estimation problem with unit radius balls is also studied for some special classes of graphs

Published in:

Theory and Computing Systems, 1993., Proceedings of the 2nd Israel Symposium on the

Date of Conference:

7-9 Jun 1993