Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,317,623 papers from all fields of science
Search
Sign In
Create Free Account
Hamiltonian completion
Known as:
Hamiltonian completion problem
The Hamiltonian completion problem is to find the minimal number of edges to add to a graph to make it Hamiltonian. The problem is clearly NP-hard in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
APX
Cactus graph
Caterpillar tree
Complexity class
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
Stavros D. Nikolopoulos
J. Parallel Distributed Comput.
2004
Corpus ID: 15133928
1998
1998
On Hamiltonian Cycles in Trees
R. Topor
,
Shao Dong Chen
,
Hong Shen
1998
Corpus ID: 17406406
We present a simple algorithm for constructing Hamiltonian cycles on trees together with additional edges between leaves, compute…
Expand
1996
1996
Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth
H. Bodlaender
,
B. D. Fluiter
International Computing and Combinatorics…
1996
Corpus ID: 41524298
This paper presents some new ideas and results on graph reduction applied to graphs with bounded treewidth. Arnborg et al. [2…
Expand
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)
ACCEPT & CONTINUE