688 search results - page 6 / 138 » General Partitioning on Random Graphs |
LATIN
2000
Springer
15 years 1 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
UAI
2003
14 years 11 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
73
Voted
COMBINATORICA
2007
14 years 9 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
78
Voted
ARSCOM
2004
14 years 9 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
ICNP
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...