316 search results - page 2 / 64 » On almost self-complementary graphs |
CDC
2008
IEEE
13 years 11 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...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
FUIN
2010
13 years 2 months ago
2010
We study 0-1 laws for extensions of first-order logic by Lindstr
JCT
2011
13 years 5 days ago
2011
SIGECOM
2009
ACM
13 years 11 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...