Results 61 to 70 of about 1,848,326 (324)
Vervet monkey (Chlorocebus pygerythrus) behavior in a multi-destination route: Evidence for planning ahead when heuristics fail. [PDF]
PLoS ONE, 2018 Animal paths are analogous to intractable mathematical problems like the Traveling Salesman Problem (TSP) and the shortest path problem (SPP). Both the TSP and SPP require an individual to find the shortest path through multiple targets but the TSP ...
Julie Annette Teichroeb +1 more
doaj +1 more source
Faster Replacement Paths [PDF]
, 2010 The replacement paths problem for directed graphs is to find for given nodes s and t and every edge e on the shortest path between them, the shortest path between s and t which avoids e.
Williams, Virginia Vassilevska
core +2 more sources
Stochastic Shortest Path Games [PDF]
SIAM Journal on Control and Optimization, 1999 Summary: We consider dynamic, two-player, zero-sum games where the ``minimizing'' player seeks to drive an underlying finite-state dynamic system to a special terminal state along a least expected cost path. The ``maximizer'' seeks to interfere with the minimizer's progress so as to maximize the expected total cost.
Patek, Stephen D., Bertsekas, Dimitri P.
openaire +1 more source
Mapping the evolution of mitochondrial complex I through structural variation
FEBS Letters, EarlyView.Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin +2 more
wiley +1 more source
Cybergeo, 2007 The quantitative study of an infrastructure network in geography often consists in assessing indicators on the network components (nodes and sections). In that respect, the network is modelled by a graph whose vertices and edges respectively correspond ...
Jean-François Gleyze
doaj +1 more source
Intrinsic Correlation with Betweenness Centrality and Distribution of Shortest Paths
Mathematics, 2022 Betweenness centrality evaluates the importance of nodes and edges in networks and is one of the most pivotal indices in complex network analysis; for example, it is widely used in centrality ordering, failure cascading modeling, and path planning ...
Yelai Feng +3 more
doaj +1 more source
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
FEBS Letters, EarlyView.The Ile181Asn variant of human UDP‐xylose synthase (hUXS1), associated with a short‐stature genetic syndrome, has previously been reported as inactive. Our findings demonstrate that Ile181Asn‐hUXS1 retains catalytic activity similar to the wild‐type but exhibits reduced stability, a looser oligomeric state, and an increased tendency to precipitate ...
Tuo Li +2 more
wiley +1 more source
Policy-Preferred Paths in AS-level Internet Topology Graphs
Theory and Applications of Graphs, 2018 Using Autonomous System (AS) level Internet topology maps to determine accurate AS-level paths is essential for network diagnostics, performance optimization, security enforcement, business policy management and topology-aware application development ...
Mehmet Tozal
doaj +1 more source
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 +7 more
doaj +1 more source