1542 search results - page 72 / 309 » The metamathematics of random graphs |
BIOINFORMATICS
2007
14 years 10 months ago
2007
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
APPROX
2010
Springer
14 years 11 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...
ACSC
2005
IEEE
15 years 3 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)...
CDC
2008
IEEE
15 years 4 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...
CORR
2010
Springer
14 years 10 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...