2503 search results - page 200 / 501 » A study of 3-arc graphs |
171
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
195
click to vote
CIBCB
2007
IEEE
16 years 29 days ago
2007
IEEE
The susceptible, infected, removed model for epidemics assumes that the population in which the epidemic takes place is well mixed. This strong assumption can be relaxed by permit...
180
click to vote
GLOBECOM
2007
IEEE
16 years 29 days ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
146
click to vote
EUROPAR
2007
Springer
16 years 23 days ago
2007
Springer
In this work we study preference systems suitable for the Peer-to-Peer paradigm. Most of them fall in one of the three following categories: global, symmetric and complementary. Al...
142
click to vote
GLOBECOM
2006
IEEE
16 years 20 days ago
2006
IEEE
— While the Internet continues to thrive, the resiliency of its fundamental routing infrastructure is not fully understood. In this paper, we analyze the behavior of the de facto...