325 search results - page 29 / 65 » Hamilton cycles in random graphs and directed graphs |
ISPAN
1997
IEEE
14 years 26 days 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...
STRINGOLOGY
2008
13 years 10 months ago
2008
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
TSP
2008
13 years 8 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
IPL
2006
13 years 8 months ago
2006
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...