Results 71 to 80 of about 524,063 (295)

Reconfiguration of vertex-disjoint shortest paths on graphs

Journal of Graph Algorithms and Applications
We introduce and study reconfiguration problems for (internally) vertex-disjoint shortest paths: Given two tuples of internally vertex-disjoint shortest paths for fixed terminal pairs in an unweighted graph, we are asked to determine whether one tuple ...
Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara   +3 more
doaj   +1 more source

Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping

Nature Communications, 2023
Shortest paths between the nodes of complex networks are challenging to obtain if the information on network structure is incomplete. Here the authors show that the shortest paths are geometrically localized in hyperbolic representations of networks, and
Maksim Kitsak, Alexander Ganin, Ahmed Elmokashfi, Hongzhu Cui, Daniel A. Eisenberg, David L. Alderson, Dmitry Korkin, Igor Linkov   +7 more
doaj   +1 more source

Geometric kth shortest paths [PDF]

, 2015
Finding shortest paths in planar domains bounded by polygons is a well-studied problem in computational geometry. However, in many applications, only finding the shortest path is not sufficient: we need to be able to generate a list of short paths among ...
Talvitie, Topi
core  

The disjoint shortest paths problem [PDF]

, 1998
The disjoint shortest paths problem is defined as follows. Given a graph G and k pairs of distinct vertices (si, ti), 1 ⩽ i ⩽ k, find whether there exist k pairwise disjoint shortest paths Pi, between si and ti for all 1 ⩽i ⩽ k.
Eilam-Tzoreff, Tali
core   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

FEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill, Yelyzaveta Pulnova, Elke De Zitter, Helen M. Ginn, Briony A. Yorke   +4 more
wiley   +1 more source

Connectivity aware routing - a method for finding bandwidth constrained paths over a variety of network topologies [PDF]

, 2003
Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in networks which feature dynamically set up paths with bandwidth and delay ...
M. Collier, Collier, Martin, Kowalik, Karol, K. Kowalik   +3 more
core   +2 more sources

Contact networks have small metric backbones that maintain community structure and are primary transmission subgraphs.

PLoS Computational Biology, 2023
The structure of social networks strongly affects how different phenomena spread in human society, from the transmission of information to the propagation of contagious diseases.
Rion Brattig Correia, Alain Barrat, Luis M Rocha   +2 more
doaj   +1 more source

A new flow chip in combination with multiphoton microscopy as a protocol for longitudinal 3D imaging of tissue calcification under shear stress

FEBS Open Bio, EarlyView.
Miniaturized flow chip platform enabling continuous perfusion and longitudinal multiphoton 3D imaging of vascular smooth muscle cell constructs under physiological flow. Brightfield imaging guides region selection, while CellTracker Green and mRuby‐labeled fetuin‐A visualize cells and mineral deposition, respectively. Magnesium supplementation markedly
Vytautas Kučikas, Aaron D. Morgan, Ignas Čiurlionis, Christian Böhm, Stefan Jockenhövel, Willi Jahnen‐Dechent, Marc A. M. J. van Zandvoort   +6 more
wiley   +1 more source

Shortest-Path Reconstruction Algorithms [PDF]

The Computer Journal, 1993
Summary: We study the problem of computing shortest paths between pairs of vertices in an \(n\)-vertex graph, given only the all pairs shortest paths distance matrix. This computation is called a reconstruction, since the algorithm has no access to explicit information about edges in the original graph. We present the following results: 1.
openaire   +2 more sources

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   +3 more sources