5 search results - page 1 / 1 » Hamilton Cycles in Random Graphs with a Fixed Degree Sequenc... |
SIAMDM
2010
12 years 11 months ago
2010
Let d = d1 d2
CORR
2011
Springer
12 years 12 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
JAIR
1998
13 years 4 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
CPC
2002
13 years 4 months ago
2002
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
ISPAN
1997
IEEE
13 years 9 months ago
1997
IEEE
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...