Results 101 to 110 of about 49,625 (158)

Shortest Path Planning Strategies through Evolutionary Algorithms

Journal of Intelligent Systems, 2007
Ramachandra Rao, K., Saini, Nitish
doaj   +1 more source

Spatially-global integration of closed, fragmented contours by finding the shortest-path in a log-polar representation. [PDF]

Vision Res, 2016
Kwon T, Agrawal K, Li Y, Pizlo Z.
europepmc   +1 more source

Community structure unveils the path multiplicity in complex networks. [PDF]

Nat Commun
Deng Y, Wu J, Lu X, Holme P, Li D, Di Z, Chen G, Kurths J.   +7 more
europepmc   +1 more source

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. [PDF]

Theory Comput Syst
Bentert M, Fomin FV, Golovach PA.
europepmc   +1 more source

IRN2Vec: A representation learning model for road network intersections by integrating geospatial attributes and travel behaviors. [PDF]

PLoS One
Yang X.
europepmc   +1 more source

Harary index of the zero divisor graph of upper triangular matrices. [PDF]

Sci Rep
Alshanqiti O, Sharma S, Bhat VK.
europepmc   +1 more source

The effect of levodopa on speech graphs in non-demented patients with multiple system atrophy and Parkinson's disease. [PDF]

Front Neurol
Liu J, Zhao Y, Ma J, Zhang G.
europepmc   +1 more source

Network-based allosteric analysis of galectin-7: Key residues dictate functional communication and stability. [PDF]

Protein Sci
Pham NTH, Paré A, Létourneau M, Fortier M, Chatenet D, St-Pierre Y, Lagüe P, Calmettes C, Doucet N.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS

International Journal of Computational Geometry & Applications, 1996
We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the ...
Chen, Jindong, Han, Yijie
openaire   +1 more source

Shortest Path Algorithms

2008
Shortest path problems are fundamental network optimization problems arising in many contexts and having a wide range of applications, including dynamic programming, project management, knapsack problems, routing in data networks, and transportation problems.
openaire   +2 more sources