2314 search results - page 220 / 463 » Minimal Partitions of a Graph |
135
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
121
click to vote
SIGMETRICS
2005
ACM
15 years 10 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...
142
click to vote
EJC
2008
15 years 4 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
131
click to vote
MST
2006
15 years 4 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
161
click to vote
TCAD
2002
15 years 4 months ago
2002
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...