Results 81 to 90 of about 286,038 (288)
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
Multi‐Scale Interface Engineering of MXenes for Multifunctional Sensory Systems
Advanced Functional Materials, EarlyView.MXenes, as two‐dimensional transition metal carbides and nitrides, demonstrate remarkable capabilities for multifunctional sensing applications. This review systematically examines multi‐scale interface engineering approaches that enhance sensing performance, enable diverse detection functionalities, and improve system‐level compatibility in MXene ...
Jiaying Liao, Sin‐Yi Pang, Jianhua Hao
wiley +1 more source
Atomic Layer Deposition in Transistors and Monolithic 3D Integration
Advanced Functional Materials, EarlyView.Transistors are fundamental building blocks of modern electronics. This review summarizes recent progress in atomic layer deposition (ALD) for the synthesis of two‐dimensional (2D) metal oxides and transition‐metal dichalcogenides (TMDCs), with particular emphasis on their enabling role in monolithic three‐dimensional (M3D) integration for next ...
Yue Liu +5 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Dielectric capacitors typically struggle to achieve both high energy storage density and high efficiency at applied voltages below 10 V. Here, we address this challenge by introducing a novel hybrid fluorite/perovskite heterostructure design that combines ultra‐high recoverable energy storage density with efficient energy release (Uf ≈ 1016 J/cm3), at ...
Ampattu R. Jayakrishnan +10 more
wiley +1 more source
SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD
Jurnal Informatika, 2005 A travel company offers a transportation service by picking up customers from certain places and sending them to the other places. Concerning traffic in time domain function for every path, the problem is how to find the quickest paths in picking up the ...
Rolly Intan
doaj
An Efficient Algorithm for Touring n Circles
MATEC Web of Conferences, 2018 This paper proposed an intelligent algorithm, which can build the shortest path of the intersecting circle sequences in the plane. The problem is transformed to a corresponding problem of computing the shortest path of three disjoint circles.
Ding Yuepeng, Xie Xiong, Jiang Bo
doaj +1 more source
Structural and Chemical Engineering of Sub‐Nanochannel Membranes Toward Ion Selectivity
Advanced Functional Materials, EarlyView.This review summarizes recent advances in structural and chemical engineering of sub‐nanochannels for ion selectivity. We first introduce fundamental ion transport mechanisms within sub‐nanochannels, followed by strategies to tune pore size, geometry, and surface functionalities, categorized into charge‐based, ion‐recognition, hydrophilic bonding, and ...
Yuyu Su +5 more
wiley +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
Implementation of Circle-Breaking Algorithm on Fermatean Neutrosophic Graph to discover Shortest Path [PDF]
Neutrosophic Sets and SystemsIn 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 +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 +3 more
europepmc +1 more source