Results 31 to 40 of about 76,992 (320)
Orientations of hamiltonian cycles in large digraphs [PDF]
, 1986 We prove that, with some exceptions, every digraph with n ≥ 9 vertices and at least (n - 1) (n - 2) + 2 arcs contains all orientations of a Hamiltonian ...
Adam Pawel Wojda +3 more
core +2 more sources
Hamiltonian cycles and travelling salesfolk
International Journal of Science and Research (IJSR), 2023 A method is given in this paper that makes it easier to solve both the Hamiltonian cycle problem and the travelling salesman problem in any number of space dimensions and in both their directed and undirected varieties.
openaire +1 more source
Hamiltonian Chains in Hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Hamiltionian chain is a generalisation of hamiltonian cycles for hypergraphs. Among the several possible ways of generalisations this is probably the most strong one, it requires the strongest structure.
Gyula Y. Katona
doaj +1 more source
On the behavior of periodic solutions of planar autonomous Hamiltonian systems with multivalued periodic perturbations [PDF]
, 2010 Aim of the paper is to provide a method to analyze the behavior of $T$-periodic solutions $x_\eps, \eps>0$, of a perturbed planar Hamiltonian system near a cycle $x_0$, of smallest period $T$, of the unperturbed system. The perturbation is represented by
Makarenkov, Oleg +2 more
core +2 more sources
Alternating Hamiltonian cycles in $2$-edge-colored multigraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an $\mathcal{NP ...
Alejandro Contreras-Balbuena +2 more
doaj +1 more source
The Parity of Directed Hamiltonian Cycles [PDF]
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n) time and polynomial space. For bipartite graphs, we give a 1.5^n poly(n) expected time algorithm. Our algorithms are based on a new combinatorial formula for the number of Hamiltonian cycles modulo a ...
Björklund, Andreas, Husfeldt, Thore
openaire +3 more sources
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes [PDF]
Journal of Combinatorial Theory, Series B, 2021 We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a complete rank, or, equivalently, of size $1 + {{n-1} \choose d}$.
Rogers Mathew +3 more
openaire +4 more sources
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Discussiones Mathematicae Graph Theory, 2020 Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once.
Lee Hung-Chih, Chen Zhen-Chun
doaj +1 more source
Problems on Shortest k-Node Cycles and Paths
Кібернетика та комп'ютерні технології, 2021 The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph.
Petro Stetsyuk +2 more
doaj +1 more source
Hamiltonian quantum simulation with bounded-strength controls [PDF]
, 2013 We propose dynamical control schemes for Hamiltonian simulation in many-body quantum systems that avoid instantaneous control operations and rely solely on realistic bounded-strength control Hamiltonians.
Bookatz, Adam D. +2 more
core +4 more sources