475 search results - page 32 / 95 » Z3-Connectivity with Independent Number 2 |
CRYPTO
2012
Springer
12 years 9 days ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
TMI
1998
13 years 9 months ago
1998
— Guidance systems designed for neurosurgery, hip surgery, and spine surgery, and for approaches to other anatomy that is relatively rigid can use rigid-body transformations to a...
JGT
2007
13 years 9 months ago
2007
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc...
DCC
2008
IEEE
14 years 9 months ago
2008
IEEE
Symmetric multilevel diversity coding was introduced by Roche et al, where a set of K information sources is encoded by K encoders and the decoders reconstruct sources 1, . . . , ...