Hamiltonian path


Also found in: Wikipedia.

Hamiltonian path

[‚ham·əl′tō·nē·ən ‚path]
(mathematics)
A path along the edges of a graph that traverses every vertex exactly once and terminates at its starting point. Also known as Hamiltonian circuit; Hamiltonian cycle.

Hamiltonian path

References in periodicals archive ?
A Hamiltonian path will ensure that all the visualization schemes are presented before a participant.
Sixty participants agreed to take part in the experiment, for whom outputs from any one of the five data-subsets were chosen and were shown as per a chosen Hamiltonian path from those available.
Among the topics are synthesizing cyclotriphosphazene containing an aminopropylsilicone functional group as a flame retardant, the design and analysis of an optical-communication-band sub-wavelength grating polarizer, the synthesis and electrochromic properties of crystalline three-dimensional urchin-like nanostructures, calculating the beating-up force for three-dimensional weaving, the aging process of vegetable insulating oil, an algorithm for extracting visual features from images of the surface of Mars, and self-learning by robots and the model of a Hamiltonian path with a fixed number of color repetitions for systems of scenarios creation.
A Hamiltonian path in G may be realized as a subgraph [P.
The research team including four faculty members and 15 undergraduate students from the biology and mathematics departments engineered the DNA of Escherichia coli bacteria and created bacterial computers capable of solving a classic mathematical problem known as the Hamiltonian Path Problem.
It was previously known that an unconstrained Hamiltonian path exists in a triangular grid under very mild conditions, and that there are triangular grids for which there is no through-edge Hamiltonian path.
Adleman used his DNA computer to solve the Hamiltonian Path problem that most of us likely encountered in junior high or high school math class.
Mathematically, this is known as the directed Hamiltonian path problem, and it serves as a surrogate for a wide variety of practical computational problems.
Moreover, the practical applications are often not limited to theoretical problems like the Hamiltonian path problem, or K-node disjoint path problems.
Topics include orthogonal matrices and wireless communications, probabilistic expectations on unstructured spaces, higher order necessary conditions in smooth constrained optimization, Hamiltonian paths and hyperbolic patterns, fair allocation methods for coalition games, sums-of-squares formulas, product-free subsets of groups, generalizations of product- free subsets, and vertex algebras and twisted bialgebras.
Similar Hamiltonian paths can be found on the other four Platonic solids".
Some specific topics are connectivity, planarity, Hamiltonian paths and cycles, matching theory, digraphs, networks, and adaptive network structures for data/text pattern recognition theory.