463 search results - page 12 / 93 » The Most Reliable Subgraph Problem |
DSN
2003
IEEE
14 years 21 days ago
2003
IEEE
This paper presents a formal model for asynchronous distributed systems with servers that may exhibit Byzantine faults or crash and subsequently recover. The model is computationa...
VTC
2010
IEEE
13 years 5 months ago
2010
IEEE
— Much work has been done aiming at minimization of energy consumption for transmission of information in energy constrained wireless networks. However, most of them assume uncod...
ARSCOM
2005
13 years 7 months ago
2005
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
NETWORKING
2007
13 years 8 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
SIAMDM
2008
13 years 7 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...