2310 search results - page 170 / 462 » Coloring Random Graphs |
151
Voted
WINE
2010
Springer
15 years 10 days ago
2010
Springer
Abstract. We present a new technique for analyzing the rate of convergence of local dynamics in bargaining networks. The technique reduces balancing in a bargaining network to opti...
141
Voted
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
118
click to vote
DM
2007
15 years 2 months ago
2007
—We give an inequality for the group chromatic number of a graph as an extension of Brooks’ Theorem. Moreover, we obtain a structural theorem for graphs satisfying the equality...
100
click to vote
JACM
2002
15 years 2 months ago
2002
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planar...
153
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...