3267 search results - page 290 / 654 » Generalized quasirandom graphs |
194
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we study the vaccination of graphs against the outbreak of infectious diseases, in the following natural model generalizing a model by Aspnes et al.: An infectious ...
223
Voted
ACPC
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
182
Voted
MFCS
1997
Springer
15 years 11 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
158
click to vote
SOFSEM
1997
Springer
15 years 11 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
205
click to vote
ESA
1994
Springer
15 years 11 months ago
1994
Springer
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...