Results 11 to 20 of about 371,797 (314)
When the path is never shortest: a reality check on shortest path biocomputation [PDF]
, 2017 Shortest path problems are a touchstone for evaluating the computing performance and functional range of novel computing substrates. Much has been published in recent years regarding the use of biocomputers to solve minimal path problems such as route ...
A Adamatzky +28 more
core +3 more sources
On shortest paths and sorting [PDF]
Proceedings of the ACM annual conference on - ACM'72, 1972 In finding shortest paths, the operation of finding, successively, a minimum from a list of numbers may require more work than the remainder of the algorithm. It is shown how algorithms from sorting literature can be used to accomplish this part of the shortest path algorithm.
E. L. Johnson
openalex +3 more sources
The College Mathematics Journal, 2021 35 pages, including 3 appendices and program ...
Richard Goldstone +2 more
openaire +3 more sources
Performance of shortest path algorithm based on parallel vertex traversal [PDF]
Serbian Journal of Electrical Engineering, 2016 Shortest path algorithms for different applications, such as Internet routing, VLSI design and so on are used. Dijkstra and Bellman-Ford are commonly used shortest path algorithms which are typically implemented in networks with hundreds of ...
Vesović Mihailo +2 more
doaj +1 more source
On orientations and shortest paths [PDF]
Linear Algebra and its Applications, 1989 AbstractAn orientation of an undirected graph is a choice of direction for each of its edges. An orientation is called ideal with respect to a given set of pairs of vertices if it does not increase the shortest-path distances between the members of any of the pairs. A polynomial-time algorithm is given for constructing an ideal orientation with respect
Nimrod Megiddo +2 more
openaire +1 more source
Finding an induced path that is not a shortest path [PDF]
Discrete Mathematics, 2021 We give a polynomial-time algorithm that, with input a graph $G$ and two vertices $u,v$ of $G$, decides whether there is an induced $uv$-path that is longer than the shortest $uv$-path.
Eli Berger, Paul Seymour, Sophie Spirkl
openaire +4 more sources
Shortest paths in conservative graphs
Discrete Mathematics, 2001 AbstractWe give a polynomial algorithm to compute shortest paths in weighted undirected graphs with no negative cycles (conservative graphs). We show that our procedure gives a simple algorithm to compute optimal T-joins (and consequently all of their special cases, including weighted matchings). We finally give a direct algorithmic proof for arbitrary
Michele Conforti, Roméo Rizzi
openalex +5 more sources
Expected Length of the Shortest Path of the Traveling Salesman Problem in 3D Space
Journal of Advanced Transportation, 2022 Finding the shortest path of the traveling salesman problem (TSP) is a typical NP-hard problem and one of the basic optimization problems. TSP in three-dimensional space (3D-TSP) is an extension of TSP. It plays an important role in the fields of 3D path
Hongtai Yang +5 more
doaj +1 more source
, 2023 Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its Euclidean metric.
Löffler, M. +3 more
openaire +7 more sources
Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linear multicomodity multicost network [PDF]
EAI Endorsed Transactions on Industrial Networks and Intelligent Systems, 2017 The shortest path finding algorithm is used in many problems on graphs and networks. This article will introduce the algorithm to find the shortest path between two vertices on the extended graph.
Chien Tran Quoc, Hung Ho Van
doaj +1 more source