1591 search results - page 4 / 319 » Random lifts of graphs |
EJC
2006
13 years 11 months ago
2006
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
MIDDLEWARE
2010
Springer
13 years 9 months ago
2010
Springer
This paper presents LiFTinG, the first protocol to detect freeriders, including colluding ones, in gossip-based content dissemination systems with asymmetric data exchanges. LiFT...
MFCS
2007
Springer
14 years 5 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
INTERNET
2010
13 years 9 months ago
2010
s the HTTP request–response cycle rather than wrapping HTTP concepts in APIs. This means you put HTML element definition and action in the same place: var name = "" SHt...
