1591 search results - page 113 / 319 » Random lifts of graphs |
180
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 ...
143
click to vote
SPAA
2000
ACM
15 years 10 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
172
click to vote
CPC
2006
15 years 6 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
155
click to vote
IPL
2006
15 years 6 months ago
2006
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...
162
click to vote
XSYM
2004
Springer
15 years 11 months ago
2004
Springer
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...