325 search results - page 28 / 65 » Hamilton cycles in random graphs and directed graphs |
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
IMCSIT
2010
13 years 6 months ago
2010
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
STOC
2010
ACM
14 years 16 days ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
WAW
2009
Springer
14 years 3 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...