325 search results - page 6 / 65 » Hamilton cycles in random graphs and directed graphs |
148
click to vote
EJC
2006
15 years 6 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...
162
click to vote
DM
2008
15 years 6 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...
162
click to vote
FCT
2009
Springer
16 years 17 days 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...
169
click to vote
CEC
2008
IEEE
16 years 14 days 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...