Results 91 to 100 of about 280,639 (334)

Finding k-Dissimilar Paths with Minimum Collective Length

, 2018
Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough.
Blumenthal, David B., Bouros, Panagiotis, Chondrogiannis, Theodoros, Gamper, Johann, Leser, Ulf   +4 more
core   +1 more source

Z‐Scheme Water Splitting Systems Based on Solid‐State Electron Conductors

Advanced Functional Materials, EarlyView.
This review examines the latest advances in Z‐scheme overall water splitting (OWS) systems for solar hydrogen production. These systems consist of suspended or immobilized hydrogen evolution photocatalysts (HEPs) and oxygen evolution photocatalysts (OEPs).
Chen Gu, Takashi Hisatomi, Tsuyoshi Takata, Kazunari Domen   +3 more
wiley   +1 more source

Maximal buttonings of trees

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

Implementation of Circle-Breaking Algorithm on Fermatean Neutrosophic Graph to discover Shortest Path [PDF]

Neutrosophic Sets and Systems
In many scientific domains, there is a growing interest in the shortest path problem. Traffic routes that can be precisely defined become arbitrary due to the damage that natural catastrophes inflict on roads and bridges.
S. krishna Prabha, Said Broumi, Souhail Dhouib, Mohamed Talea   +3 more
doaj   +1 more source

Distributed algorithms from arboreal ants for the shortest path problem. [PDF]

Proc Natl Acad Sci U S A, 2023
Garg S, Shiragur K, Gordon DM, Charikar M.   +3 more
europepmc   +1 more source

Quasi‐Periodic Surface Functionalization by Ultra‐Short Pulsed Laser Processing: Unlocking Superior Heat Transfer in Vapor Chambers

Advanced Functional Materials, EarlyView.
Ultra‐short pulsed laser processing (ULSP) enables scalable, open‐air fabrication of self‐organized, quasi‐periodic micro/nanostructures on copper using 100 µm laser beams, orders of magnitude larger than the resulting surface features. Integrated into ultra‐thin, wick‐free vapor chambers, these laser‐functionalized surfaces dramatically enhance ...
Anish Pal, Arani Mukhopadhyay, Graham Kaufman, Suchit Sarin, Jeffrey E. Shield, George Gogos, Craig Zuhlke, Constantine M. Megaridis   +7 more
wiley   +1 more source

On the shortest path problem of uncertain random digraphs. [PDF]

Soft comput, 2022
Li H, Zhang K.
europepmc   +1 more source

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm

, 2017
Study the general single-source shortest path problem. Firstly, define a path function on a set of some path with same source on a graph, and develop a kind of general single-source shortest path problem (GSSSP) on the defined path function.
Cheng, Cong-Dian
core  

Path planning algorithm for a car like robot based on Coronoi Diagram Method [PDF]

, 2013
The purpose of this study is to develop an efficient offline path planning algorithm that is capable of finding optimal collision-free paths from a starting point to a goal point. The algorithm is based on Voronoi diagram method for the environment
Inun, Haidie
core  

Shortest path problems with node failures [PDF]

Networks, 1992
AbstractConsider the problem of finding the shortest paths from a node source s to a node sink t in a complete network. On any given instance of the problem, only a subset of the intermediate nodes can be used to go from s to t, the subset being chosen according to a given probability law.
openaire   +3 more sources