CORR
2011
Springer
13 years 7 months ago
2011
Springer
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
ENDM
2007
14 years 3 months ago
2007
For a set of distances D = {d1, . . . , dk} a set A is called D-avoiding if no pair of points of A is at distance di for some i. We show that the density of A is exponentially sma...