148 search results - page 12 / 30 » Sums of powers of the degrees of a graph |
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
We study a natural extension of classical evolutionary game theory to a setting in which pairwise interactions are restricted to the edges of an undirected graph or network. We ge...
NETWORKS
2008
14 years 11 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
108
click to vote
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
113
click to vote
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
104
click to vote
SCALESPACE
2007
Springer
15 years 5 months ago
2007
Springer
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies image and mesh filtering. The approach considers the problem as a variation...