159 search results - page 27 / 32 » Undirected Graphs of Entanglement 2 |
161
click to vote
PRDC
2006
IEEE
15 years 11 months ago
2006
IEEE
Dependable systems are usually designed with multiple instances of components or logical processes, and often possess symmetries that may be exploited in model-based evaluation. T...
168
click to vote
IJCM
2002
15 years 5 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
132
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
160
click to vote
MP
2006
15 years 5 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
164
click to vote
TIT
2010
15 years 5 days ago
2010
Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the reg...