Results 61 to 70 of about 1,865,243 (219)
Parallel Backtracking Algorithm for Hamiltonian Path Search
Communications, 2009 The speed of calculations is a common problem to tackle in many areas of scientific research and real life. This paper presents an implementation of a parallel backtracking algorithm.
Karol Grondzak, Penka Martincova
doaj +1 more source
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Christian Löwenstein +2 more
doaj +1 more source
Robust and Safe Autonomous Navigation for Systems With Learned SE(3) Hamiltonian Dynamics
IEEE Open Journal of Control Systems, 2022 Stability and safety are critical properties for successful deployment of automatic control systems. As a motivating example, consider autonomous mobile robot navigation in a complex environment. A control design that generalizes to different operational
Zhichao Li, Thai Duong, Nikolay Atanasov
doaj +1 more source
On reciprocal degree distance of graphs
Heliyon, 2023 Given a connected graph H, its reciprocal degree distance is defined asRDD(H)=∑x≠ydH(vx)+dH(vy)dH(vx,vy), where dH(vx) denotes the degree of the vertex vx in the graph H and dH(vx,vy) is the shortest distance between vx and vy in H.
Mingqiang An +3 more
doaj +1 more source
On coefficients of path polynomials
International Journal of Mathematics and Mathematical Sciences, 1984 Explicit formulae, in terms of sugraphs of the graph, are given for the first six coefficients of the simple path polynomial of a graph. From these, explicit formulae are deduced for the number of hamiltonian paths in graphs with up to six nodes.
E. J. Farrell
doaj +1 more source
AIMS Mathematics, 2021 Noise is regarded as an unavoidable component of digital image acquisition. Hence, noise removal has been considered as one of the fundamental tasks in the field of image processing. Accordingly, excellent results have been achieved by using second-order
Abdelgader Siddig +3 more
doaj +1 more source
Hamiltonian paths and hamiltonian connectivity in graphs
Discrete Mathematics, 1993 A degree and neighborhood type condition on independent triples of vertices of a graph \(G\) that implies \(G\) is hamiltonian-connected is given. In particular, the following is proved. If \(G\) is a 3-connected graph of order \(n\) such that \(d(u) + d(v) + d(w)-| N(u) \cap N(v) \cap N(w) | \geq n+1,\) then \(G\) is hamiltonian-connected.
openaire +2 more sources
Hamiltonian paths in L-shaped grid graphs
Theoretical Computer Science, 2016 28 pages, 31 figures, and 20 ...
Keshavarz-Kohjerdi, Fatemeh +1 more
openaire +3 more sources
On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes
Discussiones Mathematicae Graph Theory, 2016 The balanced hypercube BHn, defined by Wu and Huang, is a variant of the hypercube network Qn, and has been proved to have better properties than Qn with the same number of links and processors.
Cao Jianxiang, Shi Minyong, Feng Lihua
doaj +1 more source
Hamiltonian Quantization of Effective Lagrangians with Massive Vector Fields
, 1993 Effective Lagrangians containing arbitrary interactions of massive vector fields are quantized within the Hamiltonian path integral formalism. It is proven that correct Hamiltonian quantization of these models yields the same result as naive Lagrangian ...
A. C. Longhitano +59 more
core +1 more source