1949 search results - page 60 / 390 » Random graphs on surfaces |
141
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
149
Voted
ACSC
2005
IEEE
15 years 9 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
135
click to vote
SIAMDM
2010
14 years 10 months ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
136
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
124
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...