Cargando…
New Sufficient Conditions for Hamiltonian Paths
A Hamiltonian path in a graph is a path involving all the vertices of the graph. In this paper, we revisit the famous Hamiltonian path problem and present new sufficient conditions for the existence of a Hamiltonian path in a graph.
Autores principales: | Rahman, M. Sohel, Kaykobad, M., Firoz, Jesun Sahariar |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4090529/ https://www.ncbi.nlm.nih.gov/pubmed/25045745 http://dx.doi.org/10.1155/2014/743431 |
Ejemplares similares
-
Path integrals and Hamiltonians: principles and methods
por: Baaquie, Belal E
Publicado: (2014) -
Hamiltonian path analysis of viral genomes
por: Twarock, Reidun, et al.
Publicado: (2018) -
Gene selection for cancer classification with the help of bees
por: Moosa, Johra Muhammad, et al.
Publicado: (2016) -
Hamiltonian Paths Through Two- and Three-Dimensional Grids
por: Mitchell, William F.
Publicado: (2005) -
An Image Encryption Algorithm Based on Random Hamiltonian Path
por: Zhang, Wei, et al.
Publicado: (2020)