Results 141 to 150 of about 7,825 (160)

Hamiltonian path in permutation graphs

Theoretical Computer Science
The Hamiltonian path problem is NP-complete for general graphs. The notion of a follow-up vertex in a permutation graph is introduced in this research, with respect to its Hasse diagram. A necessary and sufficient condition is justified for the existence of a Hamiltonian path in a permutation graph in terms of the existence of a follow-up vertex ...
Krishna Daripa, Alak Kumar Datta
openaire   +1 more source

Hamiltonian paths in distance graphs

Mathematical Notes, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Hamiltonian Path

2008
openaire   +1 more source

Hamiltonian form of the path integral for theories with a gauge freedom

Physics Reports, 1985
Marc Henneaux
exaly  

Hamiltonian formulation of general relativity and post-Newtonian dynamics of compact binaries

Living Reviews in Relativity, 2018
Piotr Jaranowski
exaly  

Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs

Information Sciences, 2013
Jung-Heum Park
exaly  

Solution reaction path Hamiltonian for reactions in polar solvents. II. Applications

Journal of Chemical Physics, 1988
James T Hynes
exaly  

On evaluating the reaction path Hamiltonian

Journal of Chemical Physics, 1988
Michael Page
exaly  

Hamiltonian theories of the fractional quantum Hall effect

Reviews of Modern Physics, 2003
R Shankar
exaly  

–approximation algorithm for two variants of a 2-depot Hamiltonian path problem

Operations Research Letters, 2010
Sivakumar Rathinam, Raja Sengupta
exaly