Results 31 to 40 of about 49,625 (158)
, 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 +8 more sources
On the Maximal Shortest Paths Cover Number
Mathematics, 2021 A shortest path P of a graph G is maximal if P is not contained as a subpath in any other shortest path. A set S⊆V(G) is a maximal shortest paths cover if every maximal shortest path of G contains a vertex of S.
Iztok Peterin, Gabriel Semanišin
doaj +1 more source
MATEC Web of Conferences, 2016 Under ideal condition, there are lots of Shortest Path Algorithms such as Dijkstra, Floyd, Johnson algorithms. However, putting these algorithms into use is not as we expected.
Luo Jian Feng, Chen Yu Qiang
doaj +1 more source
Cooperative strategy to reduce path length in risky environments
Tecnura, 2023 Objective: Design an artificial intelligence system based on information from the environment that can recommend the shortest path to an individual or vehicle, or robot that moves between two points with the lowest risk of contagion with coronavirus ...
José Andrés Chaves Osorio +2 more
doaj +1 more source
Exploring the transmission of cognitive task information through optimal brain pathways.
PLoS Computational BiologyUnderstanding the large-scale information processing that underlies complex human cognition is the central goal of cognitive neuroscience. While emerging activity flow models demonstrate that cognitive task information is transferred by interregional ...
Zhengdong Wang +6 more
doaj +1 more source
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem
IEEE Access, 2021 The clustered shortest-path tree problem (CluSPTP) is an extension of the classical single-source shortest-path problem, in which, given a graph with the set of nodes partitioned into a predefined, mutually exclusive and exhaustive set of clusters, we ...
Ovidiu Cosma +2 more
doaj +1 more source
Engineering Shortest Path Algorithms [PDF]
, 2004 In this paper, we report on our own experience in studying a fundamental problem on graphs: all pairs shortest paths. In particular, we discuss the interplay between theory and practice in engineering a simple variant of Dijkstra’s shortest path algorithm.
DEMETRESCU, Camil, Giuseppe F. Italiano
openaire +2 more sources
Physarum can compute shortest paths [PDF]
Journal of Theoretical Biology, 2012 Physarum Polycephalum is a slime mold that is apparently able to solve shortest path problems. A mathematical model has been proposed by biologists to describe the feedback mechanism used by the slime mold to adapt its tubular channels while foraging two food sources s0 and s1.
Bonifaci V, Mehlhorn K, Varma G
openaire +10 more sources
INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2019 The shortest path problem is widely applied in transportation, communication and computer networks. It addresses the challenges of determining a path with minimum distance, time or cost from a source to the destination.
S. Behzadi, M. Kolbadinejad
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2014 A buttoning of a tree that has vertices v1, v2, . . . , vn is a closed walk that starts at v1 and travels along the shortest path in the tree to v2, and then along the shortest path to v3, and so forth, finishing with the shortest path from vn to v1 ...
Short Ian
doaj +1 more source