Results 231 to 240 of about 3,188,937 (280)

Fast superconducting qubit control with subharmonic drives. [PDF]

Nat Commun
Xia M, Zhou C, Liu C, Patel P, Cao X, Lu P, Mesits B, Mucci M, Gorski D, Pekker D, Hatridge M.   +10 more
europepmc   +1 more source

A Monte Carlo Study of Dynamic Phase Transitions Observed in the Kinetic <i>S</i> = 1 Ising Model on Nonregular Lattices. [PDF]

Entropy (Basel)
Yüksel Y.
europepmc   +1 more source

A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation

, 2019
Mahdi Belbasi, Martin Fürer
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

From One to Many Rainbow Hamiltonian Cycles

Graphs and Combinatorics, 2021
Given a graph G and a family G={G1,…,Gn}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt ...
Peter Bradshaw, Kevin Halasz, L. Stacho
semanticscholar   +1 more source

On Hamiltonian cycles and Hamiltonian paths

Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rahman, M. Sohel, Kaykobad, M.
openaire   +1 more source

Alternating Hamiltonian cycles

Israel Journal of Mathematics, 1976
For natural numbers \(n\) and \(d\), let \(K_n(\Delta_c \leq d)\) denote a complete graph of order \(n\) whose edges are colored so that no vertex belongs to more than \(d\) edges of the same color, and where \(\Delta_c\) is the maximal degree in the subgraph formed by the edges of color \(c\). D. E. Daykin proved that if \(d=2\) and \(n \geq 6\), then
Bollobás, Béla, Erdős, Paul
openaire   +1 more source

Finding Hamiltonian Cycles

Science, 1996
L. Adleman has proposed and demonstrated a highly novel approach using DNA and the tools of molecular biology to solve the famous Hamiltonian cycle problem (HCP) of computer science: Given a directed graph on N vertices ( N cities and a set of R ≤ N 2 one-way roads connecting the cities), does there exist a subset of the roads in which a tour of the ...
Eric Lewin Altschuler, Martin Lades, Richard Stong   +2 more
openaire   +1 more source

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.
Filar, JA, Krass, D
openaire   +3 more sources