111 search results - page 3 / 23 » The Hamiltonian p-Median Problem |
DAM
2011
13 years 1 months ago
2011
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is ∗ Research supported by grants No. 1M0545...
DAM
1999
13 years 7 months ago
1999
We survey results on the sequential and parallel complexity of hamiltonian path and cycle problems in various classes of digraphs which generalize tournaments. We give detailed in...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
CDC
2009
IEEE
13 years 5 months ago
2009
IEEE
This paper is devoted to path following control for port-Hamiltonian systems whose desired path is timevarying. Most of the existing results on path following can only take care of...
TOC
2008
13 years 7 months ago
2008
Abstract: We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a running time propor...