Results 151 to 160 of about 841,975 (192)

Orbital hybridization engineering, a built-in electric field, and simultaneous carbon layer charge rearrangement boost carrier migration for a superior cathode material. [PDF]

Chem Sci
Huo Y, Li S, Zhang M, Yang X, Li S, Feng Y, Shi H, Duan S, Chen Y.   +8 more
europepmc   +1 more source

Synergistic effects of detuning and auxiliary qubits on quantum synchronization. [PDF]

Sci Rep
Houshmand Almani AH, Mortezapour A, Nourmandipour A.   +2 more
europepmc   +1 more source

Bias and Its Control in Stochastic Approaches to Electronic-Structure Theory. [PDF]

J Chem Theory Comput
Savchenko P, Adhikari S, Hadad E, Rabani E, Baer R.   +4 more
europepmc   +1 more source

Spatiotemporal dynamics of scattering exceptional points. [PDF]

Nat Commun
Xiao Y, Che Z, Shi L, Wang X, Zhu J.
europepmc   +1 more source

Thermodynamic Limits of Fault-Tolerant Quantum Computing Beyond the Weak-Coupling, Quasistatic Regime. [PDF]

Entropy (Basel)
Guha Majumdar M.
europepmc   +1 more source

Harmonic Control of Dynamical Freezing in Programmable Rydberg Atom Arrays

Ghosh R, Sarkar M, Zindorf B, Mukherjee B, Bose S.   +4 more
europepmc   +1 more source

Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes [PDF]

Journal of Combinatorial Theory Series B, 2021
We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a complete rank, or, equivalently, of size $1 + {{n-1} \choose d}$.
Deepak Rajendraprasad, Ilan Newman, Rogers Mathew   +2 more
exaly   +6 more sources

On Hamiltonian alternating cycles and paths [PDF]

Computational Geometry: Theory and Applications, 2018
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this paper, we relax the constraint on the cycles and paths from being plane to being 1-plane, and deal with the same ...
Carlos Seara, Delia Garijo, Mercè Claverol   +2 more
exaly   +10 more sources

Some of the next articles are maybe not open access.

Related searches:

Hamiltonian Cycles and Markov Chains

Mathematics of Operations Research, 1994
In this paper we derive new characterizations of the Hamiltonian cycles of a directed graph, and a new LP-relaxation of the Traveling Salesman Problem. Our results are obtained via an embedding of these combinatorial optimization problems in suitably perturbed controlled Markov chains.

exaly   +5 more sources

On Hamiltonian cycles and Hamiltonian paths

Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M Sohel Rahman
exaly   +3 more sources