منابع مشابه
Packing paths of length at least two
We give a simple proof for Kaneko’s theorem which gives a su2cient and necessary condition for the existence of vertex disjoint paths in a graph, each of length at least two, that altogether cover all vertices of the original graph. Moreover we generalize this theorem and give a formula for the maximum number of vertices that can be covered by such a path system. c © 2004 Elsevier B.V. All righ...
متن کاملFinding Good Paths: Applications of Least Cost Caloric Path Computations
As you walk around during your daily life, you commonly make path finding decisions based on the world around you. For example, when you are walking in the outdoors, you take the path of least resistance over a terrain. We present two applications which demonstrate the importance of using the least cost caloric cost path computation in two different domain settings. One application uses the pop...
متن کاملAnalytical Synthesis of Least Curvature 2d Paths for Underwater Applications
Calculating smooth trajectories of bounded curvature has received a very wide attention in the robotic literature of the last 40 years. Most results focus on the study of wheeled non-holonomic vehicles and are concerned with 2D path generation algorithms. The problem of smooth and least curvature 3D path planning is addressed with a variational approach and the general 3D Euler-Poisson equation...
متن کاملCutpoints and resistance of random walk paths
We construct a bounded degree graph G, such that a simple random walk on it is transient but the random walk path (i.e., the subgraph of all the edges the random walk has crossed) has only finitely many cutpoints, almost surely. We also prove that the expected number of cutpoints of any transient Markov chain is infinite. This answers two questions of James, Lyons and Peres [4]. Additionally, w...
متن کاملLeast Expected Time Paths in Stochastic, Time-Varying Transportation Networks
We consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 2009
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.326.5956.1043-d