Results 1  10
of
3,296
Computational Experiments for the Problem of Hamiltonian Path with Fixed Number of Color Repetitions
"... In this paper we consider an approach to solve the problem of Hamiltonian path with fixed number of color repetitions for arccolored digraphs. Our approach is based on usage of local search algorithms to solve a logical model for the problem. PACS: 07.05.Fb, 07.05.Dz ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we consider an approach to solve the problem of Hamiltonian path with fixed number of color repetitions for arccolored digraphs. Our approach is based on usage of local search algorithms to solve a logical model for the problem. PACS: 07.05.Fb, 07.05.Dz
A DP Approach to Hamiltonian Path Problem
, 2013
"... A Dynamic Programming based polynomial worst case time and space algorithm is described for computing Hamiltonian Path of a directed graph. Complexity constructive proofs along with a tested C++ implementation are provided as well. The result is obtained via the use of original colored hypergraph s ..."
Abstract
 Add to MetaCart
A Dynamic Programming based polynomial worst case time and space algorithm is described for computing Hamiltonian Path of a directed graph. Complexity constructive proofs along with a tested C++ implementation are provided as well. The result is obtained via the use of original colored hypergraph
Hamiltonian Paths and Cycles in Planar Graphs
"... Abstract. We examine the problem of counting the number of Hamiltonian paths and Hamiltonian cycles in outerplanar graphs and planar graphs, respectively. We give an O(nαn) upper bound and an Ω(αn) lower bound on the maximum number of Hamiltonian paths in an outerplanar graph with n vertices, wher ..."
Abstract
 Add to MetaCart
Abstract. We examine the problem of counting the number of Hamiltonian paths and Hamiltonian cycles in outerplanar graphs and planar graphs, respectively. We give an O(nαn) upper bound and an Ω(αn) lower bound on the maximum number of Hamiltonian paths in an outerplanar graph with n vertices
Hybrid Metaheuristics for the Clustered Vehicle Routing Problem
, 2014
"... Abstract. The Clustered Vehicle Routing Problem (CluVRP) is a variant of the Capacitated Vehicle Routing Problem in which customers are grouped into clusters. Each cluster has to be visited once, and a vehicle entering a cluster cannot leave it until all customers have been visited. This article pr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
the shortest Hamiltonian path between each pair of vertices within each cluster should be precomputed. Using this information, a sequence of clusters can be used as a solution representation and large neighborhoods can be efficiently explored by means of bidirectional dynamic programming, sequence
Either/or: Using vertex cover structure in designing FPTalgorithms—the case of kinternal spanning tree
 In Proceedings of WADS 2003, Workshop on Algorithms and Data Structures, volume 2748 of LNCS
, 2003
"... Abstract. To determine if a graph has a spanning tree with few leaves is NPhard as HAMILTONIAN PATH is a special case. In this paper we study the parametric dual of this problem, kINTERNAL SPANNING TREE (Does G have a spanning tree with at least k internal vertices?). We give an algorithm running ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Abstract. To determine if a graph has a spanning tree with few leaves is NPhard as HAMILTONIAN PATH is a special case. In this paper we study the parametric dual of this problem, kINTERNAL SPANNING TREE (Does G have a spanning tree with at least k internal vertices?). We give an algorithm
Lighttrail networks: Design and survivability
, 2005
"... The lighttrail architecture provides a novel solution to address IPcentric issues at the optical layer. By incorporating drop and continue functionality, overlaid with a lightweight control protocol, lighttrails enable efficient sharing of network resources, support subwavelength traffic and m ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
and minimize costs. In this work, we investigate network design and survivability issues in such networks in the presence of multigranularity subwavelength traffic subject to nonbifurcation constraints. We first establish the NPHardness of the lighttrail routing problem by reduction from a Hamiltonian
Solving connectivity problems parameterized by treewidth in single exponential time (Extended Abstract)
, 2011
"... For the vast majority of local problems on graphs of small treewidth (where by local we mean that a solution can be verified by checking separately the neighbourhood of each vertex), standard dynamic programming techniques give c tw V  O(1) time algorithms, where tw is the treewidth of the input g ..."
Abstract

Cited by 33 (7 self)
 Add to MetaCart
to produce c tw V  O(1) time Monte Carlo algorithms for most connectivitytype problems, including HAMILTONIAN PATH, STEINER TREE, FEEDBACK VERTEX SET and CONNECTED DOMINATING SET. These results have numerous consequences in various fields, like parameterized complexity, exact and approximate algorithms
The Visibility Graph of Congruent Discs is Hamiltonian
, 2002
"... We show that the visibility graph of a set of disjoint congruent discs in R² is Hamiltonian, as long as the discs are not all supported by the same line. The proof is constructive, and leads to efficient algorithms for obtaining a Hamilton circuit. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We show that the visibility graph of a set of disjoint congruent discs in R² is Hamiltonian, as long as the discs are not all supported by the same line. The proof is constructive, and leads to efficient algorithms for obtaining a Hamilton circuit.
PTSymmetric Quantum Brachistochrone
"... Given an initial quantum state I 〉 and a final quantum state F 〉, there exist Hamiltonians H under which I 〉 evolves into F 〉. The quantum brachistochrone problem is to find the H that achieves this transformation in the least time τ, subject to the constraint that the difference between the la ..."
Abstract
 Add to MetaCart
Given an initial quantum state I 〉 and a final quantum state F 〉, there exist Hamiltonians H under which I 〉 evolves into F 〉. The quantum brachistochrone problem is to find the H that achieves this transformation in the least time τ, subject to the constraint that the difference between
Strong Tournaments with the Fewest Hamiltonian Paths
"... Busch recently determined the minimum number of Hamiltonian paths a strong tournament can have. We characterize the strong tournaments that realize this minimum. 1. ..."
Abstract
 Add to MetaCart
Busch recently determined the minimum number of Hamiltonian paths a strong tournament can have. We characterize the strong tournaments that realize this minimum. 1.
Results 1  10
of
3,296