Results 291 to 300 of about 76,992 (320)

Detecting Hamiltonian cycles

Applied Mathematics and Computation, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Hamiltonian Cycles and Markov Chains

Mathematics of Operations Research, 1994
In this paper we derive new characterizations of the Hamiltonian cycles of a directed graph, and a new LP-relaxation of the Traveling Salesman Problem. Our results are obtained via an embedding of these combinatorial optimization problems in suitably perturbed controlled Markov chains.
Filar, JA, Krass, D
openaire   +4 more sources

A parallel reduction of Hamiltonian cycle to Hamiltonian Path in tournaments [PDF]

Journal of Algorithms, 1993
Summary: We propose a parallel algorithm which reduces the problem of computing Hamiltonian cycles in tournaments to the problem of computing Hamiltonian paths. The running time of our algorithm is \(O(\log n)\) using \(O(n^2/\log n)\) processors on a CRCW PRAM, and \(O(\log n \log \log n)\) on an EREW PRAM using \(O(n^2/ \log n \log \log n ...
Evripidis Bampis, Miklos Santha, Miklos Santha, M. El Haddad, Yannis Manoussakis   +4 more
openaire   +2 more sources

Degeneration of Hamiltonian monodromy cycles

Nonlinearity, 1993
This paper is concerned with the global topology of solution trajectories to integrable Hamiltonian systems near ``degenerate'' critical points of the energy-momentum map. The present study is restricted to two examples, the Kirchhoff top and the spherical pendulum in an axially symmetric quadratic potential.
L Bates, Maorong Zou
openaire   +3 more sources

On the Number of Hamiltonian Cycles in a Tournament

Combinatorics, Probability and Computing, 2005
It is shown that the maximum number \(C(n)\) of Hamiltonian cycles in a tournament of order \(n\) satisfies the inequaltiy \(C(n) < O(n^{3/2-\varepsilon}(n-1)!2^{-n})\), where \(\varepsilon = .2507\dots\). No claim is made concerning the sharpness of the bound.
Ehud Friedgut, Jeff Kahn
openaire   +2 more sources

On the number of Hamiltonian cycles in triangulations

Journal of Graph Theory, 1988
AbstractIt is proved that if a planar triangulation different from K3 and K4 contains a Hamiltonian cycle, then it contains at least four of them. Together with the result of Hakimi, Schmeichel, and Thomassen [2], this yields that, for n ⩾ 12, the minimum number of Hamiltonian cycles in a Hamiltonian planar triangulation on n vertices is four.
Dainis Zeps, Jan Kratochvíl
openaire   +2 more sources

Hamiltonian Cycles of Adjacent Triples

Studies in Applied Mathematics, 1980
A construction is given for ordering triples chosen from an ordered set of elements, so that each triple agrees with each neighbor in two of its members and has third member that is a neighbor of its neighbor's third member. Neighbors here are adjacent in order, and also the first is neighbor to the last among both elements and triples.
openaire   +2 more sources

Hamiltonian Cycles in Products of Graphs

Canadian Mathematical Bulletin, 1975
Let V(G) and E(G) denote the vertex set and the edge set of a graph G; let Kn denote the complete graph with n vertices and let Kn, m denote the complete bipartite graph on n and m vertices. A Hamiltonian cycle (Hamiltonian path, respectively) in a graph G is a cycle (path, respectively) in G that contains all the vertices of G.
openaire   +2 more sources

Hamiltonian cycles in bipartite graphs

Combinatorica, 1995
Let \(G= (X, Y; E)\) be a balanced bipartite graph with vertex classes \(X\), \(Y\), edge set \(E\), and \(|X|= |Y|= n\). The balanced independence number \(\alpha^*(G)\) is defined to be \[ \max\{|A|: A\subseteq X\cup Y\wedge A\text{ is independent }\wedge \bigl||A\cap X|- |A\cap Y|\bigr|\leq 1\}.
openaire   +3 more sources

Cell cycle control in cancer

Nature Reviews Molecular Cell Biology, 2021
Helen K Matthews, Cosetta Bertoli, Robertus A M De Bruin   +2 more
exaly