1736 search results - page 186 / 348 » On antimagic directed graphs |
185
click to vote
JUCS
2002
15 years 6 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
186
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The multi domain nature of a mechatronic system makes it difficult to model using a single modeling technique over the whole system as varying sets of system variables are require...
161
click to vote
ASPDAC
2000
ACM
15 years 10 months ago
2000
ACM
- This paper describes the design and implementation of a reconfigurable synchronized dataflow processor (RSDP). The RSDP can configure its hardware to directly represent dataflow ...
137
click to vote
NIPS
2008
15 years 8 months ago
2008
We present a characterization of a useful class of skills based on a graphical representation of an agent's interaction with its environment. Our characterization uses betwee...
140
click to vote
JGT
2007
15 years 6 months ago
2007
: A (directed) cycle C in a graph is called consistent provided there exists an automorphism of , acting as a 1-step rotation of C. A beautiful but not well-known result of J.H. Co...