3268 search results - page 652 / 654 » The hub number of a graph |
170
click to vote
JOI
2011
15 years 1 months ago
2011
The popular h-index used to measure scientific output can be described in terms of a pool of evaluated objects (the papers), a quality function on the evaluated objects (the numb...
198
click to vote
WWW
2011
ACM
15 years 29 days ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
205
click to vote
SIAMIS
2010
15 years 24 days ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
204
click to vote
TSP
2010
15 years 22 days ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
185
click to vote
CORR
2011
Springer
15 years 16 days ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...