4865 search results - page 347 / 973 » The Complexity of Graph Connectivity |
175
click to vote
SIROCCO
2010
15 years 8 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
130
click to vote
DAM
2006
15 years 6 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
169
click to vote
IM
2008
15 years 6 months ago
2008
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
204
Voted
TON
2010
15 years 1 months ago
2010
Abstract--This paper develops novel mechanisms for recovering from failures in IP networks with proactive backup path calculations and IP tunneling. The primary scheme provides res...
197
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...