1493 search results - page 23 / 299 » Local resilience of graphs |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
FOCS
2006
IEEE
14 years 1 months 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...
FOCS
2002
IEEE
14 years 19 days ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
AAAI
2006
13 years 9 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
FOCS
2009
IEEE
14 years 2 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 ...