Buscar
Mostrando ítems 1-10 de 110
Hamiltonian problems for reducible flowgraphs
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
Proper Hamiltonian Paths in Edge-Colored Multigraphs
(Elsevier, 2011-12)
A c-edge-colored multigraph has each edge colored with one of the c available colors and no two parallel edges have the same color. A proper hamiltonian path is a path containing all the vertices of the multigraph such ...
Proper hamiltonian paths in edge-coloured multigraphs
(Springer Tokyo, 2017-07)
Given a c-edge-coloured multigraph, where c is a positive integer, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we ...
Grafos hamiltonianos aplicado al turismo de Panamá
(Universidad Católica Santa María La Antigua, 2019)
Faul-Free Hamiltonian Cycle in Faulty MÖbius Cubes
(Computación y Sistemas, 2009)
Quadratic Hamiltonians in phase-space quantum mechanics
(1989-07)
The dynamical evolution is described within the phase-space
formalism by means of the Moyal propagator, which is the symbol of the
evolution operator. Quadratic Hamiltonians on the phase space are
distinguished in that ...
Dynamical quantization and classical limit
(Natl Research Council CanadaOttawaCanadá, 2003)
The Hamiltonian path problem applied to genomes assembly
(Universidad de los AndesIngeniería de Sistemas y ComputaciónFacultad de IngenieríaDepartamento de Ingeniería de Sistemas y Computación, 2019)
El propósito de este trabajo es diseñar e implementar un algoritmo capaz de determinar si un grafo contiene un camino Hamiltoniano o no, de manera eficiente. Además, evaluar la posibilidad de aplicar el camino Hamiltoniano ...
Hamiltonian formalism and path entropy maximization
(IOP, 2015)
Maximization of the path information entropy is a clear prescription for constructing models in
non-equilibrium statistical mechanics. Here it is shown that, following this prescription under the
assumption of arbitrary ...