Results 31 to 40 of about 218,626 (238)
Shortest Paths in Microseconds
CoRR, 2013 Extended version of WOSN'12 paper: new techniques (reduced memory, faster computations), distributed (MapReduce) algorithm, multiple paths between a source-destination ...
Rachit Agarwal 0001 +3 more
openaire +2 more sources
Should QoS routing algorithms prefer shortest paths? [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 ...
Collier, Martin, Kowalik, Karol
core +2 more sources
Percolating paths through random points : [PDF]
, 2005 We prove consistency of four different approaches to formalizing the idea of minimum average edge-length in a path linking some infinite subset of points of a Poisson process.
Aldous, David, Krikun, Maxim
core +4 more sources
Discriminative Distance-Based Network Indices with Application to Link Prediction [PDF]
, 2018 In large networks, using the length of shortest paths as the distance measure has shortcomings. A well-studied shortcoming is that extending it to disconnected graphs and directed graphs is controversial.
Abdessalem, Talel +2 more
core +2 more sources
Computational Geometry Column 35 [PDF]
, 1998 The subquadratic algorithm of Kapoor for finding shortest paths on a polyhedron is ...
O'Rourke, Joseph
core +5 more sources
FEBS Letters, EarlyView.This study reveals a unique active site enriched in methionine residues and demonstrates that these residues play a critical role by stabilizing carbocation intermediates through novel sulfur–cation interactions. Structure‐guided mutagenesis further revealed variants with significantly altered product profiles, enhancing pseudopterosin formation. These
Marion Ringel +13 more
wiley +1 more source
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
Shortest paths in orthogonal graphs [PDF]
, 1991 Orthogonal graphs were introduced as a simple but powerful tool for the description and analysis of a class of interconnection networks. Routing, and hence finding shortest paths between any two nodes of an orthogonal graph, becomes an important problem.
Bhatia, Sandeep +2 more
core
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
, 2014 We consider the all pairs all shortest paths (APASP) problem, which maintains the shortest path dag rooted at every vertex in a directed graph G=(V,E) with positive edge weights.
C Demetrescu +7 more
core +1 more source
The Competition for Shortest Paths on Sparse Graphs [PDF]
, 2012 Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion.
Saad, David, Yeung, Chi Ho
core +2 more sources