Sciweavers

Share
190 search results - page 1 / 38
» Using FPGAs to solve the Hamiltonian cycle problem
Sort
View
ISCAS
2003
IEEE
116views Hardware» more  ISCAS 2003»
10 years 3 months ago
Using FPGAs to solve the Hamiltonian cycle problem
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
Micaela Serra, Kenneth B. Kent
WG
2009
Springer
10 years 4 months ago
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, ļ¬nding an exact al...
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Dan...
JAIR
1998
92views more  JAIR 1998»
9 years 9 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
SARA
2009
Springer
10 years 4 months ago
Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
Miroslav N. Velev, Ping Gao 0002
DM
2010
85views more  DM 2010»
9 years 9 months ago
Hamiltonian decompositions of complete k-uniform hypergraphs
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We ...
Robert F. Bailey, Brett Stevens
books