Hamiltonian problems for reducible flowgraphs

Authors:
O. Vernet;L. Markenzon
Affiliations:
-;-
Venue:
SCCC '97 Proceedings of the 17th International Conference of the Chilean Computer Science Society
Year:
1997

Citing 0
Cited 1

Solving problems for maximal reducible flowgraphs

Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)

Quantified Score

Hi-index	0.00

Visualization

Abstract

l Abstract: 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.