Related papers: Solving the Hamiltonian path problem with a light-…
An array of a finite number waveguides, driven laterally by injecting light at the outer waveguides, is considered. The array is modeled by a discrete nonlinear Schr\"{o}dinger equation. It has been shown [Phys. Rev. Lett. 94, 243902…
Our studies are related to a special class of FASS-curves, which can be described in a node-rewriting Lindenmayer-system. These ortho-tile (or diagonal) type recursive curves inducing Hamiltonian paths. We define a special directed graph on…
Differentiable rendering methods promise the ability to optimize various parameters of 3d scenes to achieve a desired result. However, lighting design has so far received little attention in this field. In this paper, we introduce a method…
In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal curve. The map matching problem is usually approached with…
Quantum optimization algorithms hold the promise of solving classically hard, discrete optimization problems in practice. The requirement of encoding such problems in a Hamiltonian realized with a finite -- and currently small -- number of…
Given $N$ cities and $R < N^2 - N$ directed (unidirectional/one way) roads does there exist a tour of all $N$ cities stopping at each city exactly once using the given roads (a Hamiltonian cycle)? This Hamiltonian cycle problem (HCP) is an…
The ability to resolve the polarization of light with on-chip devices represents an urgent problem in optoelectronics. The detectors with polarization resolution demonstrated so far mostly require multiple oriented detectors or movable…
Graph isomorphism problem is a known hard problem. In this paper, a novel randomized algorithm is proposed for this problem which is very simple and fast. It solves the graph isomorphism problem with running time O(n^2.373) for any pair of…
We examine the evolution of the best choice algorithm and the probability of its success from a directed path to the linear order of the same cardinality through $k$th powers of a directed path, $1 \leq k < n$. The vertices of a $k$th power…
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph classes in this context are disk graphs and proper interval graphs. We focus on the cases when the sets are paths and the host is a tree…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
This work develops new numerical methods for the solution of the tomography problem in domains with reflecting obstacles. We compare the solution's performance for Lambertian reflection, for classical tomography with unbroken rays and for…
We propose a method for designing refractive optical elements for collimated beam shaping. In this method, the problem of finding a ray mapping is formulated as a linear assignment problem, which is a discrete version of the corresponding…
In this paper, we continue the study of the Hamiltonian and longest $(s, t)$-paths of supergrid graphs. The Hamiltonian $(s, t)$-path of a graph is a Hamiltonian path between any two given vertices $s$ and $t$ in the graph, and the longest…
The replacement paths problem for directed graphs is to find for given nodes s and t and every edge e on the shortest path between them, the shortest path between s and t which avoids e. For unweighted directed graphs on n vertices, the…
The Minimum Path Cover (MPC) problem consists of finding a minimum-cardinality set of node-disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on acyclic digraphs (DAGs) where, given a subset of…
We present a method to experimentally realize large-scale permutation-symmetric Hamiltonians for continuous-time quantum protocols such as quantum walk and adiabatic quantum computation. In particular, the method can be used to perform an…
All Colors Shortest Path problem defined on an undirected graph aims at finding a shortest, possibly non-simple, path where every color occurs at least once, assuming that each vertex in the graph is associated with a color known in…
A configuration of light pulses is generated, together with emitters and receptors, that allows computing. The computing is extraordinarily high in number of flops per second, exceeding the capability of a quantum computer for a given size…
This work aims to make it easier for a specialist in one field to find and explore ideas from another field which may be useful in solving a new problem arising in his practice. It presents a methodology which serves to represent the…