253 search results - page 19 / 51 » Perfection thickness of graphs |
GLOBECOM
2008
IEEE
13 years 9 months ago
2008
IEEE
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
CPC
2010
13 years 5 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
CRYPTO
2006
Springer
14 years 6 days ago
2006
Springer
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
ACISP
2007
Springer
14 years 14 days ago
2007
Springer
This paper studies the interplay of network connectivity and perfectly secure message transmission under the corrupting influence of a Byzantine mobile adversary that may move from...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...