Results 41 to 50 of about 218,121 (185)
Vervet monkey (Chlorocebus pygerythrus) behavior in a multi-destination route: Evidence for planning ahead when heuristics fail. [PDF]
PLoS ONE, 2018 Animal paths are analogous to intractable mathematical problems like the Traveling Salesman Problem (TSP) and the shortest path problem (SPP). Both the TSP and SPP require an individual to find the shortest path through multiple targets but the TSP ...
Julie Annette Teichroeb +1 more
doaj +1 more source
A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation
International Journal of Transportation Science and Technology, 2015 Theoretical research often assumes all users are homogeneous in their route choice decision and will always pick the route with the shortest travel cost, which is not necessarily the case in reality. This paper documents the research effort in developing
Xianbiao Hu, PhD, Yi-Chang Chiu
doaj +1 more source
Computational Geometry Column 35 [PDF]
, 1998 The subquadratic algorithm of Kapoor for finding shortest paths on a polyhedron is ...
O'Rourke, Joseph
core +5 more sources
Stochastic Shortest Path Games [PDF]
SIAM Journal on Control and Optimization, 1999 Summary: We consider dynamic, two-player, zero-sum games where the ``minimizing'' player seeks to drive an underlying finite-state dynamic system to a special terminal state along a least expected cost path. The ``maximizer'' seeks to interfere with the minimizer's progress so as to maximize the expected total cost.
Patek, Stephen D., Bertsekas, Dimitri P.
openaire +1 more source
Cybergeo, 2007 The quantitative study of an infrastructure network in geography often consists in assessing indicators on the network components (nodes and sections). In that respect, the network is modelled by a graph whose vertices and edges respectively correspond ...
Jean-François Gleyze
doaj +1 more source
Intrinsic Correlation with Betweenness Centrality and Distribution of Shortest Paths
Mathematics, 2022 Betweenness centrality evaluates the importance of nodes and edges in networks and is one of the most pivotal indices in complex network analysis; for example, it is widely used in centrality ordering, failure cascading modeling, and path planning ...
Yelai Feng +3 more
doaj +1 more source
Policy-Preferred Paths in AS-level Internet Topology Graphs
Theory and Applications of Graphs, 2018 Using Autonomous System (AS) level Internet topology maps to determine accurate AS-level paths is essential for network diagnostics, performance optimization, security enforcement, business policy management and topology-aware application development ...
Mehmet Tozal
doaj +1 more source
Nature Communications, 2023 Shortest paths between the nodes of complex networks are challenging to obtain if the information on network structure is incomplete. Here the authors show that the shortest paths are geometrically localized in hyperbolic representations of networks, and
Maksim Kitsak +7 more
doaj +1 more source
Shortest paths in orthogonal graphs [PDF]
, 1991 Orthogonal graphs were introduced as a simple but powerful tool for the description and analysis of a class of interconnection networks. Routing, and hence finding shortest paths between any two nodes of an orthogonal graph, becomes an important problem.
Bhatia, Sandeep +2 more
core
Maximum st-flow in directed planar graphs via shortest paths
, 2013 Minimum cuts have been closely related to shortest paths in planar graphs via planar duality - so long as the graphs are undirected. Even maximum flows are closely related to shortest paths for the same reason - so long as the source and the sink are on ...
C. Ford +6 more
core +1 more source