Results 51 to 60 of about 158,681 (246)
Beyond the Edge: Charge‐Transfer Excitons in Organic Donor‐Acceptor Cocrystals
Advanced Functional Materials, EarlyView.Complex excitonic landscapes in acene–perfluoroacene cocrystals are unveiled by polarization‐resolved optical spectroscopy and many‐body theory. This systematic study of a prototypical model system for weakly interacting donor–acceptor compounds challenges common views of charge‐transfer excitons, providing a refined conceptual framework for ...
Sebastian Anhäuser +6 more
wiley +1 more source
Hamiltonian Paths in Some Classes of Grid Graphs
Journal of Applied Mathematics, 2012 The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we give necessary and sufficient conditions for the existence of Hamiltonian paths in L-alphabet, C-alphabet, F-alphabet, and E-alphabet grid graphs.
Fatemeh Keshavarz-Kohjerdi +1 more
doaj +1 more source
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Christian Löwenstein +2 more
doaj +1 more source
IEEE Access, 2021 In order to solve the NP-hard problem of mobile sink path planning in wireless sensor networks (WSN) where the communication range is modeled as a circular area and overlaps with each other, this paper proposes a sink node path planning method guided by ...
Zhijie Huang +4 more
doaj +1 more source
The Importance of Metal‐Organic Framework Linker Atoms for CO2 Reduction: A DFT Study
Advanced Science, EarlyView.Using DFT, we examine the role of linker atoms in CO2 reduction on copper‐based metal organic frameworks (Cu MOFs). Our calculations reveal that linker atoms may serve as both CO2 and H‐shuttling sites and suggest linker electrostatics as a descriptor for linker activity. ABSTRACT Although the metal within the secondary building unit of a metal‐organic
Ugochukwu Nwosu, Samira Siahrostami
wiley +1 more source
The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves
Theory and Applications of Graphs, 2021 The color number c(G) of a cubic graph G is the minimum cardinality of a color class of a proper 4-edge-coloring of G. It is well-known that every cubic graph G satisfies c(G) = 0 if G has a Hamiltonian cycle, and c(G) ≤ 2 if G has a Hamiltonian path. In
Analen Malnegro +2 more
doaj +1 more source
Finding Two Disjoint Simple Paths on Two Sets of Points is NP-Complete
, 2017 Finding two disjoint simple paths on two given sets of points is a geometric problem introduced by Jeff Erickson. This problem has various applications in computational geometry, like robot motion planning, generating polygon etc.
Razzazi, Mohammadreza +1 more
core +1 more source
Unveiling a Bulk WTaV Multicomponent Alloy With Superior Thermal Properties and Manufacturability
Advanced Science, EarlyView.ABSTRACT Many tungsten (W)‐based medium and high entropy alloys (HEA) demonstrate superior microstructural stability and enhanced mechanical properties as compared to pure W, effectively rendering them as viable candidate materials for extreme environments such as nuclear fusion, aerospace applications, and so on.
Ishtiaque K. Robin +11 more
wiley +1 more source
Parallel Backtracking Algorithm for Hamiltonian Path Search
Communications, 2009 The speed of calculations is a common problem to tackle in many areas of scientific research and real life. This paper presents an implementation of a parallel backtracking algorithm.
Karol Grondzak, Penka Martincova
doaj +1 more source
Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
Моделирование и анализ информационных систем, 2021 We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson polytopes is an
Alexander V. Korostil +1 more
doaj +1 more source