Sciweavers

3204 search results - page 627 / 641
» The b-chromatic Number of a Graph
Sort
View
GC
2011
Springer
13 years 2 months ago
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
Klas Markström, Andrew Thomason, Peter Wagner...
JOI
2011
140views more  JOI 2011»
13 years 2 months ago
A bibliometric index based on the collaboration distance between cited and citing authors
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...
Maria Bras-Amorós, Josep Domingo-Ferrer, Vi...
WWW
2011
ACM
13 years 2 months ago
Counting triangles and the curse of the last reducer
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...
Siddharth Suri, Sergei Vassilvitskii
SIAMIS
2010
141views more  SIAMIS 2010»
13 years 2 months ago
Optimization by Stochastic Continuation
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Marc C. Robini, Isabelle E. Magnin
TSP
2010
13 years 2 months ago
Optimization and analysis of distributed averaging with short node memory
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...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat