Results 251 to 260 of about 3,139,455 (314)

Hyperfine-Resolved Spectroscopy of Dysprosium Monoxide (DyO). [PDF]

J Phys Chem A
Lasner ZD, Ohl AT, Albright NM, Rice KL, Peng C, Cheng L, Doyle JM, Augenbraun BL.   +7 more
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:

Quantum Circuit Based on Grover Algorithm to Solve Hamiltonian Cycle Problem

2022 IEEE 4th Eurasia Conference on IOT, Communication and Engineering (ECICE), 2022
We propose the concepts of the explicit oracle and the implicit oracle for realizing quantum algorithms. Then, the quantum circuit of the well-known Grover algorithm is constructed with the explicit oracle to solve the Hamiltonian cycle problem for the ...
Jehn-Ruey Jiang
semanticscholar   +1 more source

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

International Workshop on Graph-Theoretic Concepts in Computer Science, 2020
For many algorithmic problems on graphs of treewidth $t$, a standard dynamic programming approach gives an algorithm with time and space complexity $2^{\mathcal{O}(t)}\cdot n^{\mathcal{O}(1)}$.
Jesper Nederlof, Michał Pilipczuk, C. Swennenhuis, Karol Wegrzycki   +3 more
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

Solving the Hamiltonian Cycle Problem using a Quantum Computer

Australasian Computer Science Week, 2019
We review existing quantum computational methods for solving the Hamiltonian cycle problem in different computational frameworks such as quantum circuits, quantum walks and adiabatic quantum computation.
A. Mahasinghe, R. Hua, M. Dinneen, Rajni Goyal   +3 more
semanticscholar   +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

The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems

Fundamenta Informaticae, 2019
The Hamiltonian Cycle Problem (HCP) and Travelling Salesman Problem (TSP) are long-standing and well-known NP-hard problems. The HCP is concerned with finding paths through a given graph such that those paths visit each node exactly once after the start,
J. Cooper, Radu Nicolescu
semanticscholar   +1 more source