In this paper we present a polynomial-time algorithm that finds paths of length Omega((log n/ log log n)(2)) in undirected Hamiltonian graphs, improving the previous best of Omega(log n). (C) 2003 Elsevier Inc. All rights reserved
The Hamiltonian Cycle problem is the problem of deciding whether an n-vertex graph G has a cycle pas...
[[abstract]]Given a graph, the Hamiltonian path completion problem is to find an augmenting edge set...
The problem of finding shortest Hamiltonian path in a weighted complete graph belongs to the class o...
We investigate the computational hardness of approximating the longest path and the longest cycle in...
The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we g...
AbstractA Hamiltonian path of a graph G is a simple path that contains each vertex of G exactly once...
AbstractIn this paper a polynomial algorithm called the Minram algorithm is presented which finds a ...
The longest path problem is the one that finds a longest path in a given graph. While the graph clas...
[[abstract]]Given a graph, the Hamiltonian path completion problem is to find an augmenting edge set...
AbstractA hamiltonian walk of a graph is a shortest closed walk that passes through every vertex at ...
AbstractWe give a simple algorithm to transform a Hamiltonian path in a Hamiltonian cycle, if one ex...
An algorithm for an NP-complete problem is presented, namely the existence of a Directed Hamiltonian...
We consider the problem of finding a long, simple path in an undirected graph. We present a polynomi...
[[abstract]]Given a graph, the Hamiltonian path completion problem is to find an augmenting edge set...
AbstractWe show how to find in Hamiltonian graphs a cycle of length nΩ(1/loglogn)=exp(Ω(logn/loglogn...
The Hamiltonian Cycle problem is the problem of deciding whether an n-vertex graph G has a cycle pas...
[[abstract]]Given a graph, the Hamiltonian path completion problem is to find an augmenting edge set...
The problem of finding shortest Hamiltonian path in a weighted complete graph belongs to the class o...
We investigate the computational hardness of approximating the longest path and the longest cycle in...
The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we g...
AbstractA Hamiltonian path of a graph G is a simple path that contains each vertex of G exactly once...
AbstractIn this paper a polynomial algorithm called the Minram algorithm is presented which finds a ...
The longest path problem is the one that finds a longest path in a given graph. While the graph clas...
[[abstract]]Given a graph, the Hamiltonian path completion problem is to find an augmenting edge set...
AbstractA hamiltonian walk of a graph is a shortest closed walk that passes through every vertex at ...
AbstractWe give a simple algorithm to transform a Hamiltonian path in a Hamiltonian cycle, if one ex...
An algorithm for an NP-complete problem is presented, namely the existence of a Directed Hamiltonian...
We consider the problem of finding a long, simple path in an undirected graph. We present a polynomi...
[[abstract]]Given a graph, the Hamiltonian path completion problem is to find an augmenting edge set...
AbstractWe show how to find in Hamiltonian graphs a cycle of length nΩ(1/loglogn)=exp(Ω(logn/loglogn...
The Hamiltonian Cycle problem is the problem of deciding whether an n-vertex graph G has a cycle pas...
[[abstract]]Given a graph, the Hamiltonian path completion problem is to find an augmenting edge set...
The problem of finding shortest Hamiltonian path in a weighted complete graph belongs to the class o...
DOI
Add to ORKG