3,085 research outputs found
On a hamiltonian cycle in which specified vertices are not isolated
AbstractLet G be a graph with n vertices and minimum degree at least n/2, and B a set of vertices with at least 3n/4 vertices. In this paper, we show that there exists a hamiltonian cycle in which every vertex in B is adjacent to some vertex in B
Counting Euler Tours in Undirected Bounded Treewidth Graphs
We show that counting Euler tours in undirected bounded tree-width graphs is
tractable even in parallel - by proving a upper bound. This is in
stark contrast to #P-completeness of the same problem in general graphs.
Our main technical contribution is to show how (an instance of) dynamic
programming on bounded \emph{clique-width} graphs can be performed efficiently
in parallel. Thus we show that the sequential result of Espelage, Gurski and
Wanke for efficiently computing Hamiltonian paths in bounded clique-width
graphs can be adapted in the parallel setting to count the number of
Hamiltonian paths which in turn is a tool for counting the number of Euler
tours in bounded tree-width graphs. Our technique also yields parallel
algorithms for counting longest paths and bipartite perfect matchings in
bounded-clique width graphs.
While establishing that counting Euler tours in bounded tree-width graphs can
be computed by non-uniform monotone arithmetic circuits of polynomial degree
(which characterize ) is relatively easy, establishing a uniform
bound needs a careful use of polynomial interpolation.Comment: 17 pages; There was an error in the proof of the GapL upper bound
claimed in the previous version which has been subsequently remove
A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles
Recent works have shown that quantum computers can polynomially speed up
certain SAT-solving algorithms even when the number of available qubits is
significantly smaller than the number of variables. Here we generalise this
approach. We present a framework for hybrid quantum-classical algorithms which
utilise quantum computers significantly smaller than the problem size. Given an
arbitrarily small ratio of the quantum computer to the instance size, we
achieve polynomial speedups for classical divide-and-conquer algorithms,
provided that certain criteria on the time- and space-efficiency are met. We
demonstrate how this approach can be used to enhance Eppstein's algorithm for
the cubic Hamiltonian cycle problem, and achieve a polynomial speedup for any
ratio of the number of qubits to the size of the graph.Comment: 20+2 page
- …