Results 141 to 150 of about 1,206,642 (268)
Laser &Photonics Reviews, EarlyView.High‐Q superscar modes in growth‐defined triangular GaN micro‐prism resonators enable strong exciton–photon coupling and room‐temperature polariton condensation, offering a scalable platform for integrated III‐nitride polariton devices. ABSTRACT Group III‐nitride semiconductors are regarded as key materials for realizing polariton devices operating at ...
Chan‐Young Sung +4 more
wiley +1 more source
Quasi-hamiltonian paths in semicomplete multipartite digraphs
, 2013 A quasi-hamiltonian path in a semicomplete multipartite digraph D is a path which visits each maximal independent set (also called a partite set) of D at least once. This is a generalization of a hamiltonian path in a tournament.
Simonsen, Sven +2 more
core +1 more source
Branch‐and‐Cut POPMUSIC for the Electric Vehicle Routing Problem With Time Windows
Networks, EarlyView.ABSTRACT Advancements in computer hardware and commercial software have enabled the use of branch‐and‐cut (BC) methodologies to address medium‐scale vehicle routing problems (VRPs). Despite the introduction of efficient heuristics in the literature, tailoring these approaches to suit various VRP variants, such as the electric vehicle routing problem ...
Lelisa Kebena Bijiga +2 more
wiley +1 more source
, 2017 We describe some necessary conditions for the existence of a Hamiltonian path in any graph (in other words, for a graph to be traceable). These conditions result in a linear time algorithm to decide the Hamiltonian path problem for cactus graphs.
Welke, Pascal
core +2 more sources
Networks, EarlyView.ABSTRACT The Traveling Salesman problem with pickup, delivery, and ride‐time constraints (TSPPD‐RT) requires a depot‐based vehicle to visit multiple known requests. Each request specifies a pickup vertex, corresponding delivery vertex, and maximum travel time between them (ride‐time). The goal is to find a tour that (i) starts and finishes at the depot,
Xinbo Zhang, Roberto Baldacci
wiley +1 more source
On s-hamiltonian-connected line graphs
, 2007 A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton path (a path including every vertex of G); and G is s-hamiltonian-connected if the deletion of any vertex subset with at most s vertices results in a hamiltonian ...
Yehong Shao +2 more
core
Scaling turbulence drives the general circulation
Quarterly Journal of the Royal Meteorological Society, EarlyView.The NOAA Gulfstream SP4, which deployed the GPS dropsondes over the NE Pacific Ocean as part of the Winter Storms Project during the January–March periods of 2004, 2005 and 2006. Abstract Statistical multifractal analysis of airborne and dropsonde observations is used to show that persistence of velocity after molecular collisions breaks the continuous
Adrian F. Tuck
wiley +1 more source
On regular 2-path Hamiltonian graphs
Discrete Applied Mathematics20.
Xia Li +3 more
openaire +4 more sources
SmartBot, EarlyView.World models let robots imagine alternative futures, such as successfully grasping a glass or dropping it, but visual plausibility alone does not establish trustworthiness. Here, the authors review structural constraint, reality anchoring, and trust adjudication as complementary mechanisms for shaping generation, grounding predictions in real evidence,
Chenwei Shi +3 more
wiley +1 more source
Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem. [PDF]
J Math Biol, 2018 Prohaska SJ +7 more
europepmc +1 more source