352 search results - page 31 / 71 » Partitioning Graphs into Connected Parts |
120
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
115
click to vote
SIGMETRICS
2005
ACM
15 years 9 months ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
102
click to vote
JSAT
2006
15 years 4 months ago
2006
It is well known that satisfiability of random sets of propositional clauses undergoes phase transition while the clause-to-variable ratio of the sets increases. We introduce anot...
124
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
123
click to vote
COMPGEOM
1997
ACM
15 years 8 months ago
1997
ACM
We consider the family of area bisectors of a polygon possibly with holes in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce di e...