Related papers: A canonical parameterization of paths in $\mathbb{…
The Longest Path Problem is a question of finding the maximum length between pairs of vertices of a graph. In the general case, the problem is NP-complete. However, there is a small collection of graph classes for which there exists an…
A path-following control algorithm enables a system's trajectories under its guidance to converge to and evolve along a given geometric desired path. There exist various such algorithms, but many of them can only guarantee local convergence…
We consider a constrained version of the shortest path problem on the complete graphs whose edges have independent random lengths and costs. We establish the asymptotic value of the minimum length as a function of the cost-budget within a…
We study the generalized analogues of conics for normed planes by using the following natural approach: It is well known that there are different metrical definitions of conics in the Euclidean plane. We investigate how these definitions…
A family of plane oriented continuous paths depending on a fixed real positive number $R$ is considered. For any point $x$ on the path, the previous points lie out of any circle of radius $R$ having at $x$ interior normal in a suitable…
Let $P_n$ denote the undirected path of length $n-1$. The cardinality of the set of congruence classes induced by the graph homomorphisms from $P_n$ onto $P_k$ is determined. This settles an open problem of Michels and Knauer (Disc. Math.,…
We to define a Path Integral in Lorentzian time by restricting the relevant domain of integration on $C([0,1],M)$ over a Riemannian configuration manifold $(M,g)$ and considering the dynamics of a particle evolving between to fixed…
Two graphs are isomorphic exactly when they admit the same number of homomorphisms from every graph. Hence, a graph is recognized up to isomorphism by homomorphism counts over the class of all graphs. Restricting to a specific graph class…
We extend and improve the existing characterization of the dynamics of general quadratic real polynomial maps with coefficients that depend on a single parameter $\lambda$, and generalize this characterization to cubic real polynomial maps,…
We study the average leaf-to-leaf path lengths on ordered Catalan tree graphs with $n$ nodes and show that these are equivalent to the average length of paths starting from the root node. We give an explicit analytic formula for the average…
Contrary to previous approaches bringing together algebraic geometry and signatures of paths, we introduce a Zariski topology on the space of paths itself, and study path varieties consisting of all paths whose iterated-integrals signature…
We construct a continuum of non-homeomorphic compact subspaces of the real line R without singleton components. Thus from the purely topological point of view the real line contains not only more closed sets than open sets but also more…
Classical path search assumes complete graphs and scalar optimization metrics, yet real infrastructure networks are incomplete and require multi-dimensional evaluation. We introduce the concept of traversal: a generalization of paths that…
Choose two points in the tangent bundle of the Euclidean plane $(x,X),(y,Y)\in T{ \mathbb R}^2$. In this work we characterise the immersed length minimising paths with a prescribed bound on the curvature starting at $x$, tangent to $X$;…
We introduce a general method for obtaining fixed-parameter algorithms for problems about finding paths in undirected graphs, where the length of the path could be unbounded in the parameter. The first application of our method is as…
Ambiguities arising in different approaches (canonical, quasiclassical, path integration) to quantization are discussed by an example of the mechanics of a point-like particle in the Riemannian space (the geodesic dynamics). A way to select…
Nonlinear dimensionality reduction methods have demonstrated top-notch performance in many pattern recognition and image classification tasks. Despite their popularity, they suffer from highly expensive time and memory requirements, which…
In an article published in 1987 in Combinatorica \cite{MR918397}, Frieze and Jackson established a lower bound on the length of the longest induced path (and cycle) in a sparse random graph. Their bound is obtained through a rough analysis…
In graph theory and its practical networking applications, e.g., telecommunications and transportation, the problem of finding paths has particular importance. Selecting paths requires giving scores to the alternative solutions to drive a…
Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs $G$ for which the $n$-th iterated line graph $L^n(G)$ is hamiltonian, for $n\ge2$. In this paper,…