Sciweavers

48 search results - page 4 / 10
» The Hamiltonian problem on distance-hereditary graphs
Sort
View
CSR
2010
Springer
13 years 10 months ago
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
Gerold Jäger, Weixiong Zhang
ISCAS
2003
IEEE
116views Hardware» more  ISCAS 2003»
14 years 20 days 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
DM
1999
109views more  DM 1999»
13 years 7 months ago
Hamiltonian powers in threshold and arborescent comparability graphs
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
Sam Donnelly, Garth Isaak
CORR
2007
Springer
76views Education» more  CORR 2007»
13 years 7 months ago
A Light-Based Device for Solving the Hamiltonian Path Problem
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...
Mihai Oltean
CORR
2007
Springer
93views Education» more  CORR 2007»
13 years 7 months ago
Solving the Hamiltonian path problem with a light-based computer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...
Mihai Oltean