325 search results - page 6 / 65 » Hamilton cycles in random graphs and directed graphs |
EJC
2006
13 years 7 months ago
2006
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
DM
2008
13 years 7 months ago
2008
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
ARSCOM
2006
13 years 7 months ago
2006
Let Za
FCT
2009
Springer
14 years 2 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...