Definition:Directed Hamilton Cycle Problem
Jump to navigation
Jump to search
Definition
There are two versions of the Directed Hamilton Cycle Problem.
Function Version
- Given a digraph $G$ with $n$ vertices, to find a Hamilton cycle in $G$.
Decision Version
- Given a digraph $G$ with $n$ vertices, to determine whether $G$ has a Hamilton cycle.