Add to ORKGIn this paper, we discuss hamiltonian problems for reducible flowgraphs. The main result is finding, in linear time, the unique hamiltonian cycle, if it exists. In order to obtain this result, two other related problems are solved: finding the hamiltonian path starting at the source vertex and finding the hamiltonian cycle given the hamiltonian path
AbstractFinding a Hamiltonian path or a Hamiltonian cycle in a general graph are classic NP-complete...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
AbstractAn in-tournament digraph is a digraph in which the set of in-neighbours of every vertex indu...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-08-04T12:24:58Z No. of bitstreams:...
Given a Graph G (V, E), We Consider the problem of deciding whether G is Hamiltonian, that is- wheth...
In this thesis we introduce the minimum flow cost Hamiltonian tour problem(FCHT). Given a graph and ...
In this paper we present the first deterministic polynomial time algorithm for determining the exist...
AbstractWe give a simple algorithm to transform a Hamiltonian path in a Hamiltonian cycle, if one ex...
AbstractWe survey results on the sequential and parallel complexity of hamiltonian path and cycle pr...
A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph is Hamilt...
K. Kennedy recently conjectured that for every n node reducible flow graph, there is a sequence of n...
AbstractA Hamiltonian path of a graph G is a simple path that contains each vertex of G exactly once...
AbstractThere are various greedy schemas to construct a maximal path in a given input graph. Associa...
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an u...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
AbstractFinding a Hamiltonian path or a Hamiltonian cycle in a general graph are classic NP-complete...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
AbstractAn in-tournament digraph is a digraph in which the set of in-neighbours of every vertex indu...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-08-04T12:24:58Z No. of bitstreams:...
Given a Graph G (V, E), We Consider the problem of deciding whether G is Hamiltonian, that is- wheth...
In this thesis we introduce the minimum flow cost Hamiltonian tour problem(FCHT). Given a graph and ...
In this paper we present the first deterministic polynomial time algorithm for determining the exist...
AbstractWe give a simple algorithm to transform a Hamiltonian path in a Hamiltonian cycle, if one ex...
AbstractWe survey results on the sequential and parallel complexity of hamiltonian path and cycle pr...
A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph is Hamilt...
K. Kennedy recently conjectured that for every n node reducible flow graph, there is a sequence of n...
AbstractA Hamiltonian path of a graph G is a simple path that contains each vertex of G exactly once...
AbstractThere are various greedy schemas to construct a maximal path in a given input graph. Associa...
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an u...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
AbstractFinding a Hamiltonian path or a Hamiltonian cycle in a general graph are classic NP-complete...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
AbstractAn in-tournament digraph is a digraph in which the set of in-neighbours of every vertex indu...