Results 51 to 60 of about 371,797 (314)
Effects of chronic browsing on life‐history traits of an irruptive large herbivore population
Population Ecology, EarlyView.This study aimed to determine the relationship between diet quality, body mass, and size (hind foot length), and female reproduction and sought to identify the mechanism by which high density under severe food limitations is maintained. Our results demonstrated that sika deer introduced to Nakanoshima Island have maintained high densities through high ...
Koichi Kaji +9 more
wiley +1 more source
MATEC Web of Conferences, 2016 Under ideal condition, there are lots of Shortest Path Algorithms such as Dijkstra, Floyd, Johnson algorithms. However, putting these algorithms into use is not as we expected.
Luo Jian Feng, Chen Yu Qiang
doaj +1 more source
Path-Fault-Tolerant Approximate Shortest-Path Trees
, 2015 Let $G=(V,E)$ be an $n$-nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\em single-source shortest-path tree} (SPT) of $G$ with a \emph{sparse} set of \emph{auxiliary} edges selected from $E$, in order to ...
A. D’Andrea +12 more
core +1 more source
The complexity of rerouting shortest paths [PDF]
Theoretical Computer Science, 2012 The results on claw-free graphs, chordal graphs and isolated paths have been added in version 2 (april 2012). Version 1 (September 2010) only contained the PSPACE-hardness result. (Version 2 has been submitted.)
openaire +4 more sources
Network topology drives population temporal variability in experimental habitat networks
Population Ecology, EarlyView.Habitat patches connected by dispersal pathways form habitat networks. We explored how network topology affects population outcomes in laboratory experiments using a model species (Daphnia carinata). Central habitat nodes in complex lattice networks exhibited lower temporal variability in population sizes, suggesting they support more stable ...
Yiwen Xu +3 more
wiley +1 more source
Journal of Advanced Transportation, 2023 Theoretical research is conducted on finding the shortest path with stochastic and time-dependent characteristics of link travel time in urban road networks.
Yanming Sun, Jie Li, Shixian Liu
doaj +1 more source
Shortest path embeddings of graphs on surfaces [PDF]
, 2016 The classical theorem of F\'{a}ry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment.
de Mesmay, Arnaud +3 more
core +4 more sources
A stepwise emergence of evolution in the RNA world
FEBS Letters, EarlyView.How did biological evolution emerge from chemical reactions? This perspective proposes a gradual scenario of self‐organization among RNA molecules, where catalytic feedback on random mixtures plays the central role. Short oligomers cross‐ligate, and self‐assembly enables heritable variations. An event of template‐externalization marks the transition to
Philippe Nghe
wiley +1 more source
INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2019 The shortest path problem is widely applied in transportation, communication and computer networks. It addresses the challenges of determining a path with minimum distance, time or cost from a source to the destination.
S. Behzadi, M. Kolbadinejad
doaj +1 more source
FEBS Letters, EarlyView.UDP‐glucuronic acid 4‐epimerase (UGAepi) catalyzes NAD+‐dependent interconversion of UDP‐glucuronic acid (UDP‐GlcA) and UDP‐galacturonic acid (UDP‐GalA) via C4‐oxidation, 4‐keto‐intermediate rotation, and C4‐reduction. Here, Borg et al. examined the role of the substrate's carboxylate group in the enzymic mechanism by analyzing NADH‐dependent reduction
Annika J. E. Borg +2 more
wiley +1 more source