1749 search results - page 195 / 350 » Conditional colorings of graphs |
163
click to vote
FOCS
2006
IEEE
16 years 22 days ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
168
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...
178
click to vote
DM
2008
15 years 6 months ago
2008
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
173
click to vote
COMBINATORICS
1998
15 years 6 months ago
1998
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
198
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We study a simple game theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which ...