Results 51 to 60 of about 1,859,854 (274)
Hamiltonian Paths in Some Classes of Grid Graphs
Journal of Applied Mathematics, 2012 The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we give necessary and sufficient conditions for the existence of Hamiltonian paths in L-alphabet, C-alphabet, F-alphabet, and E-alphabet grid graphs.
Fatemeh Keshavarz-Kohjerdi +1 more
doaj +1 more source
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
Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
Моделирование и анализ информационных систем, 2021 We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson polytopes is an
Alexander V. Korostil +1 more
doaj +1 more source
Chromatic Roots and Hamiltonian Paths
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Energy Consumption Optimization in Trajectory Planning for Fuel Cell Hybrid Uavs Based On HMPC
Advanced Robotics Research, EarlyView.The endurance limitation of multirotor drones is a critical challenge. This study adopts a hybrid power system of fuel cells and lithium‐ion batteries. Using Nondominated Sorting Genetic Algorithm II, it integrates trajectory planning with energy management optimization.
Xindi Wang +7 more
wiley +1 more source
Absolute Differences Along Hamiltonian Paths
The Electronic Journal of Combinatorics, 2015 We prove that if the vertices of a complete graph are labeled with the elements of an arithmetic progression, then for any given vertex there is a Hamiltonian path starting at this vertex such that the absolute values of the differences of consecutive vertices along the path are pairwise distinct.
openaire +3 more sources
Semiconducting THO‐C3N Monolayers for Ultrahigh Anisotropic Carrier Mobility
Advanced Science, EarlyView.A precise site‐specific N‐doping strategy that drives a secondary electronic transition in net W is proposed, enabling the electronic properties transition from metal to Dirac semimetal and ultimately to semiconductor. The obtained THO‐C3N‐2 and THO‐C3N‐3 semiconductors exhibit high carrier mobilities and pronounced mobility anisotropy, with THO‐C3N‐2 ...
Rui Tan +7 more
wiley +1 more source
Advanced Science, EarlyView.This work demonstrates a multimodal super‐resolution imaging technique for nitrogen‐vacancy centers by integrating high‐index‐induced structured illumination with optically detected magnetic resonance. By utilizing diamond's high refractive index, the method achieves sub‐100‐nm spatial resolution and enhanced localization. This dual‐modulation strategy
Kyu Ri Choi +9 more
wiley +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
Solution of the knight's Hamiltonian path problem on chessboards
Discrete Applied Mathematics, 1994 Is it possible for a knight to visit all squares of an n × n chessboard on an admissible path exactly once? The answer is yes if and only if n ⩾ 5. The k th position in such a path can be computed with a constant number of arithmetic operations.
Axel Conrad +3 more
semanticscholar +1 more source