Skip to search formSkip to main contentSkip to account menu

Hamiltonian path problem

Known as: Directed Hamiltonian cycle problem, DHCP (disambiguation), Hamilton path problem 
In the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

33 relations
Average-case complexityBarnette's conjectureCographComplexity class

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The Hamiltonian connectivity of rectangular supergrid graphs
2013
2013
On r-Simple k-Path
An r-simple k-path is a path in the graph of length k that passes through each vertex at most r times. The r-SIMPLE k-PATH… 
2012
2012
Planarizing Gadgets for Perfect Matching Do Not Exist
To reduce a graph problem to its planar version, a standard technique is to replace crossings in a drawing of the input graph by… 
2012
2012
On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks
The goal of this work is to show that if a minimal-time solution exists for a fundamental computation primitive, synchronizing… 
2010
2010
A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree
The selected-internal Steiner minimum tree problem is a generalization of original Steiner minimum tree problem. Given a weighted… 
Review
2010
Review
2010
A Survey on Algorithms for the Maximum Internal Spanning Tree and Related Problems
2004
2004
Hamiltonian Cycles and Singularly Perturbed Markov Chains
We consider the Hamiltonian cycle problem embedded in a singularly perturbed Markov decision process. We also consider a… 
2002
2002
DNA Algorithm to the Directed Shortest Hamilton Path Problem
DNA computing is a novel method of computing and biochemistry. The DNA algorithm to the directed shortest Hamilton path problem… 
1995
1995
Hamiltonian Cycle Problem for Triangle GraphsU
We show that the Hamiltonian cycle problem is NP-complete for a class of planar graphs named triangle graphs that are closely… 
1993
1993
A Hybrid Neural Network Model for Solving Optimization Problems
A hybrid neural network model for solving optimization problems is proposed. An energy function which contains the constraints… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)