Results 51 to 60 of about 3,733 (151)
Identifying the Shortest Path of a Semidirected Graph and Its Application
Mathematics, 2022 The basic goal of this research is to find the shortest path of a semidirected graph and apply it to the road network system. In the field of graph theory, networks are described as directed graphs, undirected graphs, or a combination of both.
Rakhi Das +4 more
doaj +1 more source
Beyond Reuse Distance Analysis: Dynamic Analysis for Characterization of Data Locality Potential [PDF]
, 2013 Emerging computer architectures will feature drastically decreased flops/byte (ratio of peak processing rate to memory bandwidth) as highlighted by recent studies on Exascale architectural trends.
Elango, Venmugil +7 more
core +2 more sources
Improving The Floyd-Warshall All Pairs Shortest Paths Algorithm
, 2021 The Floyd-Warshall algorithm is the most popular algorithm for determining the shortest paths between all pairs in a graph. It is very a simple and an elegant algorithm. However, if the graph does not contain any negative weighted edge, using Dijkstra's shortest path algorithm for every vertex as a source vertex to produce all pairs shortest paths of ...
openaire +2 more sources
Software: Practice and Experience, Volume 55, Issue 10, Page 1657-1675, October 2025.ABSTRACT Background Low Earth Orbit (LEO) satellite constellations are redefining the concept of global connectivity, opening up a new world of opportunities for communication services and applications. Purpose The emergence of LEO satellites (SATs) is ushering in a new era of innovation, where new complex technologies are being developed, and the use ...
Pilar Manzanares‐Lopez +2 more
wiley +1 more source
Linker‐mediated domain separation enhances cold adaptation in cellulases
Protein Science, Volume 34, Issue 8, August 2025.Abstract Cold‐adapted cellulases have the potential to reduce energy demands in industrial processes by enabling efficient cellulose saccharification at lower temperatures. However, the structural basis of cold adaptation in bidomain cellulases remains poorly understood. Our prior studies on bidomain amylases proposed a “linker spacer effect”—a greater
Robbie Ge +3 more
wiley +1 more source
Системный анализ и прикладная информатикаIn this paper we consider two families of competing algorithms for finding the shortest paths between all pairs of vertices (APSP) in directed weighted large graphs with different edge densities: Dijkstra and Floyd-Warshall. For comparison, we have taken
A. A. Prihozhy, O. N. Karasik
doaj +1 more source
Influence of shortest path algorithms on energy consumption of multi-core processors
Системный анализ и прикладная информатика, 2023 Modern multi-core processors, operating systems and applied software are being designed towards energy efficiency, which significantly reduces energy consumption.
A. A. Prihozhy, O. N. Karasik
doaj +1 more source
Natural Sciences, Volume 5, Issue 3, July 2025.The most common cystic fibrosis mutation, F508del, destabilizes the first of two nucleotide‐binding domains (NBD1 and NBD2) and compromises Mg/ATP‐dependent gating at the interface between two transmembrane domains (TMD1 and TMD2) in the human cystic fibrosis transmembrane conductance regulator (CFTR).
Guangyu Wang
wiley +1 more source
Natural Sciences, Volume 5, Issue 1-2, April 2025.The most common cystic fibrosis‐causing F508del mutation is located in the first nucleotide‐binding domain (hNBD1) of the human cystic fibrosis transmembrane conductance regulator (hCFTR). The ATP‐dependent weakest noncovalent bridge in isolated hNBD1 is found between two specific bold residues in the biggest thermo‐ring (highlighted in red) at or near
Guangyu Wang
wiley +1 more source
Научно-технический вестник информационных технологий, механики и оптикиThe computational demands of the shortest path algorithms on large-scale graphs with millions of vertices and edges pose significant challenges for serial implementations, often requiring hours of execution time even on powerful CPUs.
D. Bodra, S. Khairnar
doaj +1 more source