172 search results - page 18 / 35 » The Analysis of a List-Coloring Algorithm on a Random Graph |
WAW
2007
Springer
14 years 1 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
CVPR
2009
IEEE
14 years 6 months ago
2009
IEEE
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
TSP
2010
13 years 2 months 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...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...