204 search results - page 16 / 41 » Packing vertices and edges in random regular graphs |
JMLR
2008
13 years 7 months ago
2008
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...
ISTCS
1993
Springer
13 years 11 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
JCT
2011
13 years 2 months ago
2011
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...